Search
Now showing items 1-10 of 19
Věty Hellyho typu a zlomkového Hellyho typu
Helly-type theorems and fractional Helly-type theorems
rigorous thesis
Date Issued:
Date of defense: 01. 06. 2009
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: Simpliciální komplex je d-reprezentovatelný, pokud je nervem souboru konvexních množin v Rd. Klasická Hellyho věta říká, že pokud d-reprezentovatelný komplex obsahuje všechny možné stěny dimenze d, potom se už nutně jedná ...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Classical Helly's Theorem states that if a d-representable complex contains all the possible faces of dimension d then it is ...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Classical Helly's Theorem states that if a d-representable complex contains all the possible faces of dimension d then it is ...
Parametrizovaná složitost v teorii grafů
Paramterized complexity in graph theory
rigorous thesis
Date Issued:
Date of defense: 01. 06. 2009
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: Seidelovo prepnutí množiny vrcholu je operace, která z grafu odebere hrany vycházející z této množiny a pridá do nej hrany tam, kde mezi množinou a zbytkem grafu nebyly. Ostatní hrany nejsou touto operací dotceny. ...
Seidel's switching of a set of vertices of a graph is an operation which deletes the edges leaving this set from the graph and adds those edges between the set and the rest of graph that weren't in the original graph. Other ...
Seidel's switching of a set of vertices of a graph is an operation which deletes the edges leaving this set from the graph and adds those edges between the set and the rest of graph that weren't in the original graph. Other ...
Kryptografie založená na kvadratických tělesech
Qudratic field based cryptography
rigorous thesis
Advisor: Stanovský, David
Date Issued:
Date of defense: 27. 01. 2010
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: Nazev prace: Kryptografie zalozena na kvadratickych telesech Autor: Milan Straka Katedra (ustav): Katedra algebry Vedouci diplomove prace: RNDr. David Stanovsky, Ph.D. E-mail vedouciho: David.Stanovsky@mff.cuni.cz Abstrakt: ...
Imaginary quadratic fields were first suggested as a setting for public-key cryptography by Buchmann and Williams already in 1988 and more cryptographic schemes followed. Although the resulting protocols are currently not ...
Imaginary quadratic fields were first suggested as a setting for public-key cryptography by Buchmann and Williams already in 1988 and more cryptographic schemes followed. Although the resulting protocols are currently not ...
d-Frames as algebraic duals of bitopological spaces
d-Framy jako algebraické duály bitopologických prostorů
dissertation thesis
Advisor: Pultr, Aleš
Date Issued:
Date of defense: 20. 02. 2018
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: Achim Jung a Drew Moshier vyvinuli dualitu pro bitopologické prostory podobnou Stoneově dualitě čímž, mimo jiné, získali praktický nástroj k vyřešení konkrétího problému v teorii stabilně kompaktních prostorů. Tímto také ...
Achim Jung and Drew Moshier developed a Stone-type duality theory for bitopological spaces, amongst others, as a practical tool for solving a particular problem in the theory of stably compact spaces. By doing so they ...
Achim Jung and Drew Moshier developed a Stone-type duality theory for bitopological spaces, amongst others, as a practical tool for solving a particular problem in the theory of stably compact spaces. By doing so they ...
Computer Modeling of Tissue Development
Počítačové modelování vývoje tkání
rigorous thesis
Advisor: Hedrlín, Zdeněk
Date Issued:
Date of defense: 10. 05. 2017
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: Nazev prace: Poci'tacove modelovani vyvoje tkam' Autor: Vojtech Bednar Katedra: Katedra aplikovane matematiky Vedoucl: Doc. RNDr. Zdenek Hedrlin, CSc. Abstrakt; Tato prace popisuje hybridnf na individualni bunce zalozeny ...
Title: Computer Modeling of Tissue Development Author: Vojtech Bednaf Department: Department of Applied Mathematics Supervisor: Doc. RNDr. Zdenek Hedrlm, CSc. Abstract: This thesis describes hybrid individual cell-based ...
Title: Computer Modeling of Tissue Development Author: Vojtech Bednaf Department: Department of Applied Mathematics Supervisor: Doc. RNDr. Zdenek Hedrlm, CSc. Abstract: This thesis describes hybrid individual cell-based ...
Extending Partial Representations of Graphs
Extending Partial Representations of Graphs
rigorous thesis
Date Issued:
Date of defense: 30. 05. 2014
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: V této práci se zabýváme geometrickými průnikovými reprezentacemi grafů. Pro danou třídu se známý problém rozpoznávání ptá, jestli graf na vstupu náleží do této třídy. Studujeme zobecnění tohoto problému nazvané rozšiřování ...
In this thesis, we study geometric intersection representations of graphs. For a fixed class, the well-known recognition problem asks whether a given graph belongs to this class. We study a generalization of this problem ...
In this thesis, we study geometric intersection representations of graphs. For a fixed class, the well-known recognition problem asks whether a given graph belongs to this class. We study a generalization of this problem ...
Some point-free aspects of connectedness
Některé bezbodové aspekty souvislosti
rigorous thesis
Advisor: Pultr, Aleš
Date Issued:
Date of defense: 19. 12. 2016
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: V této práci ukážeme Stoneovu větu o reprezentaci, která je také známa pod názvem Stoneova dualita, v bezbodovém kontextu. Předvedený důkaz je bezvýběrový, a protože se nemusíme starat o jednotlivé body, je mnohem jednodušší ...
In this thesis we present the Stone representation theorem, generally known as Stone duality in the point-free context. The proof is choice-free and, since we do not have to be concerned with points, it is by far simpler ...
In this thesis we present the Stone representation theorem, generally known as Stone duality in the point-free context. The proof is choice-free and, since we do not have to be concerned with points, it is by far simpler ...
Výpočetní složitost problémů kombinatorické optimalizace pro specifické třídy grafů
Computational complexity of combinatorial problems in specific graph classes
rigorous thesis
Advisor: Fiala, Jiří
Date Issued:
Date of defense: 08. 12. 2016
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: Tato diplomová práce se zabývá hranovou značkovatelností grafu v závislosti na parametrech p, q a λ. Pro parametry p = 2 a q = 1 jsme dokázali dichotomii. Tedy, že problém λ′ (2,1)-značkovatelnosti grafu je polynomiální ...
The topic of this diploma thesis is the edge distance labeling problem with specified parametres p, q and λ. We found a dychotomy for p = 2 and q = 1. So the problem is polynomial if λ ≤ 4 and it is NP-complete for λ > 4. ...
The topic of this diploma thesis is the edge distance labeling problem with specified parametres p, q and λ. We found a dychotomy for p = 2 and q = 1. So the problem is polynomial if λ ≤ 4 and it is NP-complete for λ > 4. ...
Structural properties of graphs and eficient algorithms: Problems Between Parameters
Strukturální vlastnosti grafů a efektivní algoritmy: Problémy separující parametry
rigorous thesis
Advisor: Fiala, Jiří
Date Issued:
Date of defense: 28. 05. 2018
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: Strukturální vlastnosti grafů a efektivní algoritmy: Problémy separující parametry Dušan Knop Parametrizovaná složitost se v přůběhu posledních dvou dekád stala jednou z nejvýznamějších oblastí výpočetní složitosti. ...
Structural Properties of Graphs and Eficient Algorithms: Problems Between Parameters Dušan Knop Parameterized complexity became over last two decades one of the most impor- tant subfield of computational complexity. ...
Structural Properties of Graphs and Eficient Algorithms: Problems Between Parameters Dušan Knop Parameterized complexity became over last two decades one of the most impor- tant subfield of computational complexity. ...
Wilf-Type Classifications, Extremal and Enumerative Theory of Ordered Structures
Wilf-Type Classifications, Extremal and Enumerative Theory of Ordered Structures
rigorous thesis
Date Issued:
Date of defense: 01. 06. 2009
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract not found