2013

Polylogarithmic Cuts in Models of V⁰
Logical Methods in Computer Science 9(1), 2013.


2012

On the Power of weak extensions of V⁰
[ printer friendly ] [ reader friendly ]
PhD Thesis, Charles University in Prague, 2012.


2011

Short Propositional Refutations for Dense Random 3CNF Formulas
With Iddo Tzameret
Manuscript, 2011. An extended abstract was presented at LICS 2012.


2010

Proof Systems that Take Advice
With Olaf Beyersdorff and Johannes Köbler
Information and Computation, Volume 209, Issue 3, March 2011, Pages 320-332.


Different Approaches to Proof Systems
With Olaf Beyersdorff
Proc. 7th Annual Conference on Theory and Applications of Models of Computation (TAMC), Springer-Verlag, LNCS 6108, Pages 50 - 59, 2010.


Proof Complexity of Propositional Default Logic
With Olaf Beyersdorff, Arne Meier, Michael Thomas and Heribert Vollmer
Proc. 13th International Conference on Theory and Applications of Satisfiability Testing (SAT), Springer-Verlag, LNCS 6175, Pages 30 - 43, 2010.


A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
With Olaf Beyersdorff
ACM Transactions on Computational Logic, Volume 11, Number 4, 2010.


2009

Does Advice Help to Prove Propositional Tautologies?
With Olaf Beyersdorff
Proc. 12th International Conference on Theory and Applications of Satisfiability Testing (SAT), Springer-Verlag, LNCS 5584, Pages 65 - 72, 2009.


Nondeterministic Instance Complexity and Proof Systems with Advice
With Olaf Beyersdorff and Johannes Köbler
Proc. 3rd International Conference on Language and Automata Theory and Applications (LATA), Springer-Verlag, LNCS 5457, Pages 164 - 175, 2009.


2008

A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
With Olaf Beyersdorff
Proc. 17th EACSL Annual Conference on Computer Science Logic (CSL), Springer-Verlag, LNCS 5213, Pages 199-214, 2008.