ℹ️
🇬🇧
Search
Search for people relevant for "complex i"
complex i
Person
Class
Person
Publication
Programmes
prof. RNDr. Ondřej Čepek Ph.D.
Academic staff at Faculty of Mathematics and Physics
10 classes
14 study programmes
103 publications
Classes
class
Boolean Functions and Their Applications
NAIL021 |
Faculty of Mathematics and Physics
class
Algorithms and Data Structures 1
NTIN060 |
Faculty of Mathematics and Physics
class
Complexity
+1
NTIN063 |
Faculty of Mathematics and Physics
class
Introduction to Complexity and Computability
+1
NTIN090 |
Faculty of Mathematics and Physics
class
Pseudo-Boolean Optimization
NTIN096 |
Faculty of Mathematics and Physics
class
Seminar on Boolean Functions 1
NTIN093 |
Faculty of Mathematics and Physics
class
Seminar on Boolean Functions 2
NTIN094 |
Faculty of Mathematics and Physics
class
Elective class at NCSU Prague
NTIN109 |
Faculty of Mathematics and Physics
Study programmes
programme
Computer Science
+1
🇨🇿 Bc. |
Faculty of Mathematics and Physics
programme
Computer Science with specialisation in Computer Graphics, Vision and Game Development
+1
🇨🇿 Bc. |
Faculty of Mathematics and Physics
programme
Computer Science with specialisation in General Computer Science
+1
🇨🇿 Bc. |
Faculty of Mathematics and Physics
programme
Computer Science with specialisation in Programming and Software Development
+1
🇨🇿 Bc. |
Faculty of Mathematics and Physics
programme
Computer Science with specialisation in Systems Programming
+1
🇨🇿 Bc. |
Faculty of Mathematics and Physics
programme
Computer Science with specialisation in Web and Data Oriented Programming
+1
🇨🇿 Bc. |
Faculty of Mathematics and Physics
programme
Computer Science with specialisation in Artificial Intelligence
+1
🇨🇿 Bc. |
Faculty of Mathematics and Physics
Load more study programmes (4)
Publications
publication
On Minimum Representations of Matched Formulas (Extended Abstract)
2017 |
Faculty of Mathematics and Physics
publication
Strong Duality in Horn Minimization
2017 |
Faculty of Mathematics and Physics
publication
A combinatorial min-max theorem and minimization of pure-Horn functions
2016 |
Faculty of Mathematics and Physics
publication
On the gap between the complexity of SAT and minimization for certain classes of boolean formulas
2014 |
Faculty of Mathematics and Physics
publication
Tractability conditions for classes of CNFs and their influence on the complexity of CNF minimization
2014 |
Faculty of Mathematics and Physics
publication
Complexity Issues Related to Propagation Completeness
2013 |
Faculty of Mathematics and Physics
publication
A decomposition method for CNF minimality proofs
2013 |
Faculty of Mathematics and Physics
publication
Boolean functions with a simple certificate for CNF complexity
2012 |
Faculty of Mathematics and Physics
publication
A note on the complexity of multislot just-in-time scheduling
2004 |
Faculty of Mathematics and Physics
publication
APPROXIMATING MINIMUM REPRESENTATIONS OF KEY HORN FUNCTIONS*
2022 |
Faculty of Mathematics and Physics
Load more publications (93)
Loading network view...