Classes
- Boolean Functions and Their ApplicationsNAIL021 | Faculty of Mathematics and Physics
- Algorithms and Data Structures 1NTIN060 | Faculty of Mathematics and Physics
- Complexity +1NTIN063 | 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
- 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
- Total tightness implies Nash-solvability for three-person game forms2012 | Faculty of Mathematics and Physics
- Weak and strong machine dominance in a nonpreemtive flowshop +32005 | Faculty of Mathematics and Physics
- Nonpreemptive flowshop scheduling with machine dominance2002 | Publication without faculty affiliation
- Weak and Strong Machine Dominance in a Nonpreemptive FlowshopPublication without faculty affiliation
- Nonpreemptive flowshops with a dominant machine: Reductions to single machine problemsPublication without faculty affiliation
- Nonpreemptive Flowshop Scheduling with Machine DominancePublication without faculty affiliation
- APPROXIMATING MINIMUM REPRESENTATIONS OF KEY HORN FUNCTIONS*2022 | Faculty of Mathematics and Physics
- Unique key Horn functions2022 | Faculty of Mathematics and Physics
- Switch lists in the landscape of knowledge representations languages2022 | Faculty of Mathematics and Physics
- A Direct Equivalence-Testing Algorithm for SLRs2022 | Faculty of Mathematics and Physics
Loading network view...