|
|
Close Help | ||||||||||||||
- PhD.students:
S.Cavagnetto ( Propositional proof complexity and rewriting, 2008),
J.Hanika ( Search problems and bounded arithmetic, 2004),
E.Jerabek ( Weak pigeonhole principle, and randomized computation, 2005).
- Master Deg. students:
T.Auer (Complexity of propositional proofs in resolution, 2001),
K.Dvorackova (Is P equal to NP over the reals with order?, 2004),
J.Henzl ( Weak formal systems, 2004),
E.Krejcova
J.Marikova ( Geometric properties of definable sets, 2003),
O.Mikle-Barat ( Strong proof systems, 2007),
F.Polach ( Propositional logic and algebra, 2008),
P.Sanda ( Implicit propositional proofs, 2006).
