Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Cutting planes, connectivity, and threshold logic., and . Arch. Math. Log., 35 (1): 33-62 (1996)Sharpened lower bounds for cut elimination.. J. Symb. Log., 77 (2): 656-668 (2012)Small Stone in Pool., and . Logical Methods in Computer Science, (2014)The Polynomial Hierarchy and Fragments of Bounded Arithmetic (Extended Abstract). STOC, page 285-290. ACM, (1985)Minimum Propositional Proof Length is NP-Hard to Linearly Approximate., , , and . MFCS, volume 1450 of Lecture Notes in Computer Science, page 176-184. Springer, (1998)Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle., and . J. Comput. Syst. Sci., 57 (2): 162-171 (1998)Computability in Europe 2009., , , and . Ann. Pure Appl. Log., 163 (5): 483-484 (2012)Propositional Consistency Proofs.. Ann. Pure Appl. Log., 52 (1-2): 3-29 (1991)Towards NP-P via proof complexity and search.. Ann. Pure Appl. Log., 163 (7): 906-917 (2012)Intuitionistic Validity in T-Normal Kripke Structures.. Ann. Pure Appl. Log., 59 (3): 159-173 (1993)