| Publication | Date of Publication | Type |
|---|
| ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS | 2024-04-09 | Paper |
| Some consequences of cryptographical conjectures for S 2 1 and EF | 2023-12-12 | Paper |
| A proof complexity conjecture and the Incompleteness theorem | 2023-03-19 | Paper |
| Extended Nullstellensatz proof systems | 2023-01-25 | Paper |
| INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH | 2022-06-15 | Paper |
| Information in propositional proofs and algorithmic proof search | 2021-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5119389 | 2020-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5114830 | 2020-06-26 | Paper |
| Small circuits and dual weak PHP in the universal theory of p-time algorithms | 2020-04-24 | Paper |
| A limitation on the KPT interpolation | 2020-04-06 | Paper |
| The Cook-Reckhow definition | 2019-09-09 | Paper |
| Expansions of pseudofinite structures and circuit and proof complexity | 2019-07-24 | Paper |
| Consistency of circuit lower bounds with bounded theories | 2019-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4630802 | 2019-04-23 | Paper |
| Proof Complexity | 2019-03-28 | Paper |
| Randomized feasible interpolation and monotone circuits with a local oracle | 2018-12-20 | Paper |
| On monotone circuits with local oracles and clique lower bounds | 2018-08-08 | Paper |
| Unprovability of circuit upper bounds in Cook's theory PV | 2017-05-08 | Paper |
| A feasible interpolation for random resolution | 2017-05-08 | Paper |
| CONSISTENCY OF CIRCUIT EVALUATION, EXTENDED RESOLUTION AND TOTAL NP SEARCH PROBLEMS | 2016-07-06 | Paper |
| A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝 Frege systems] | 2015-09-08 | Paper |
| On the computational complexity of finding hard tautologies | 2014-03-14 | Paper |
| A saturation property of structures obtained by forcing with a compact family of random variables | 2013-02-15 | Paper |
| Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator | 2012-08-15 | Paper |
| A note on SAT algorithms and proof complexity | 2012-07-25 | Paper |
| ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD NP ∩ coNP FUNCTION | 2011-10-24 | Paper |
| A note on propositional proof complexity of some Ramsey-type statements | 2011-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3072543 | 2011-02-04 | Paper |
| From Feasible Proofs to Feasible Computations | 2010-09-03 | Paper |
| A form of feasible interpolation for constant depth Frege systems | 2010-06-24 | Paper |
| Substitutions into propositional tautologies | 2010-01-29 | Paper |
| An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams | 2008-05-08 | Paper |
| Consequences of the provability of NP ⊆ P/poly | 2008-02-25 | Paper |
| NP search problems in low fragments of bounded arithmetic | 2007-07-09 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5718678 | 2006-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5694881 | 2005-10-05 | Paper |
| Hardness assumptions in the foundations of theoretical computer science | 2005-09-13 | Paper |
| Approximate Euler characteristic, dimension, and weak pigeonhole principles | 2005-08-29 | Paper |
| Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds | 2005-08-29 | Paper |
| Implicit proofs | 2005-08-29 | Paper |
| Combinatorics of first order structures and propositional proof systems | 2004-12-16 | Paper |
| Diagonalization in proof complexity | 2004-11-29 | Paper |
| DEHN FUNCTION AND LENGTH OF PROOFS | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787878 | 2003-04-03 | Paper |
| A Note on Conservativity Relations among Bounded Arithmetic Theories | 2002-05-29 | Paper |
| On the weak pigeonhole principle | 2002-02-21 | Paper |
| On the degree of ideal membership proofs from uniform families of polynomials over a finite field | 2002-02-17 | Paper |
| Uniform Families of Polynomial Equations Over a Finite Field and Structures Admitting an Euler Characteristic of Definable Sets | 2002-01-28 | Paper |
| Tautologies from Pseudo-Random Generators | 2001-09-10 | Paper |
| Combinatorics with Definable Sets: Euler Characteristics and Grothendieck Rings | 2001-07-05 | Paper |
| Embedding logics into product logic | 2001-04-19 | Paper |
| Discretely ordered modules as a first-order extension of the cutting planes proof system | 2000-02-15 | Paper |
| Lifting independence results in bounded arithmetic | 1999-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699287 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268484 | 1999-10-28 | Paper |
| Witnessing functions in bounded arithmetic and search problems | 1999-08-19 | Paper |
| Interpolation by a Game | 1999-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381413 | 1998-10-19 | Paper |
| Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic | 1998-07-08 | Paper |
| Proof complexity in algebraic systems and bounded depth Frege systems with modular counting | 1998-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395611 | 1998-06-11 | Paper |
| Some consequences of cryptographical conjectures for \(S_2^1\) and EF | 1998-05-04 | Paper |
| On induction-free provability | 1997-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4885910 | 1997-03-19 | Paper |
| Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs | 1996-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850552 | 1996-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4856172 | 1995-11-23 | Paper |
| An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle | 1995-11-05 | Paper |
| Lower bounds to the size of constant-depth propositional proofs | 1994-11-03 | Paper |
| An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic | 1994-10-09 | Paper |
| Fragments of Bounded Arithmetic and Bounded Query Classes | 1994-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140634 | 1993-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035314 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010360 | 1992-09-27 | Paper |
| Bounded arithmetic and the polynomial hierarchy | 1992-06-25 | Paper |
| Exponentiation and second-order bounded arithmetic | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359762 | 1990-01-01 | Paper |
| Quantified propositional calculi and fragments of bounded arithmetic | 1990-01-01 | Paper |
| On the number of steps in proofs | 1989-01-01 | Paper |
| On the structure of initial segments of models of arithmetic | 1989-01-01 | Paper |
| Propositional proof systems, the consistency of first order theories and the complexity of computations | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3829548 | 1989-01-01 | Paper |
| The number of proof lines and the size of proofs in first order logic | 1988-01-01 | Paper |
| Some Results and Problems in The Modal Set Theory MST | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804701 | 1988-01-01 | Paper |
| A note on proofs of falsehood | 1987-01-01 | Paper |
| A Possible Modal Formulation of Comprehension Scheme | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786479 | 1987-01-01 | Paper |
| Some Theorems on the Lattice of Local Interpretability Types | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343964 | 1984-01-01 | Paper |
