Classes
- Boolean Functions and Their ApplicationsNAIL021 | Faculty of Mathematics and Physics
- Complexity +1NTIN063 | Faculty of Mathematics and Physics
- Pseudo-Boolean OptimizationNTIN096 | Faculty of Mathematics and Physics
- Algorithms and Data Structures 1NTIN060 | Faculty of Mathematics and Physics
- Introduction to Complexity and Computability +1NTIN090 | Faculty of Mathematics and Physics
- Seminar on Boolean Functions 1NTIN093 | Faculty of Mathematics and Physics
- Seminar on Boolean Functions 2NTIN094 | Faculty of Mathematics and Physics
- Elective class at NCSU PragueNTIN109 | Faculty of Mathematics and Physics
Study programmes
- Computer Science +1🇨🇿 Bc. | Faculty of Mathematics and Physics
- Computer Science with specialisation in Computer Graphics, Vision and Game Development +1🇨🇿 Bc. | Faculty of Mathematics and Physics
- Computer Science with specialisation in General Computer Science +1🇨🇿 Bc. | Faculty of Mathematics and Physics
- Computer Science with specialisation in Programming and Software Development +1🇨🇿 Bc. | Faculty of Mathematics and Physics
- Computer Science with specialisation in Systems Programming +1🇨🇿 Bc. | Faculty of Mathematics and Physics
- Computer Science with specialisation in Web and Data Oriented Programming +1🇨🇿 Bc. | Faculty of Mathematics and Physics
- Computer Science with specialisation in Artificial Intelligence +1🇨🇿 Bc. | Faculty of Mathematics and Physics
Publications
- On Minimum Representations of Matched Formulas (Extended Abstract)2017 | Faculty of Mathematics and Physics
- Recognition of tractable DNFs representable by a constant number of intervals2017 | Faculty of Mathematics and Physics
- On the gap between the complexity of SAT and minimization for certain classes of boolean formulas2014 | Faculty of Mathematics and Physics
- On Minimum Representations of Matched Formulas2014 | Faculty of Mathematics and Physics
- Complexity Issues Related to Propagation Completeness2013 | Faculty of Mathematics and Physics
- A decomposition method for CNF minimality proofs2013 | Faculty of Mathematics and Physics
- Properties of SLUR Formulae2012 | Faculty of Mathematics and Physics
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing2005 | Faculty of Mathematics and Physics, Central Library of Charles University
- Some classes of Boolean formulae with polynomial time satisfiability testing.2002 | Publication without faculty affiliation
- Generalizations of Horn formulae and their mutual relationships2001 | Faculty of Mathematics and Physics
Loading network view...