Classes
- Boolean Functions and Their ApplicationsNAIL021 | 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
- Complexity +1NTIN063 | 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
- Pseudo-Boolean OptimizationNTIN096 | 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
- Strong Duality in Horn Minimization2017 | Faculty of Mathematics and Physics
- Recognition of tractable DNFs representable by a constant number of intervals2017 | Faculty of Mathematics and Physics
- Properties of SLUR Formulae2012 | Faculty of Mathematics and Physics
- Boolean functions with long prime implicants +12012 | 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
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines +12005 | Faculty of Mathematics and Physics
- Incremental Propagation Rules for Precedence Graph with Optional Activities and Time Windows +12005 | Faculty of Mathematics and Physics
- Weak and strong machine dominance in a nonpreemtive flowshop +32005 | Faculty of Mathematics and Physics
- Incremental Propagation Rules for A Precedence Graph with Optional Activities and Time Windows +12005 | Faculty of Mathematics and Physics
- A note on the complexity of multislot just-in-time scheduling2004 | Faculty of Mathematics and Physics
Loading network view...
