STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Space complexity in propositional calculus
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Regular resolution lower bounds for the weak pigeonhole principle
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
An exponential separation between regular and general resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Propositional Formula Checker HeerHugo
Journal of Automated Reasoning
Propositional proof complexity
Journal of the ACM (JACM)
Theoretical Computer Science - Complexity and logic
Monotone simulations of non-monotone proofs
Journal of Computer and System Sciences - Complexity 2001
A Note on Universal Measures for Weak Implicit Computational Complexity
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On Reducibility and Symmetry of Disjoint NP-Pairs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Proof Complexity of Pigeonhole Principles
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Open Least Element Principle and Bounded Query Computation
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Bounded Arithmetic and Descriptive Complexity
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Resolution Refutations and Propositional Proofs with Height-Restrictions
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Improved bounds on the weak Pigeonhole principle and infinitely many primes from weaker axioms
Theoretical Computer Science - Mathematical foundations of computer science
On reducibility and symmetry of disjoint NP pairs
Theoretical Computer Science - Mathematical foundations of computer science
Eliminating definitions and Skolem functions in first-order logic
ACM Transactions on Computational Logic (TOCL)
A new proof of the weak Pigeonhole principle
Journal of Computer and System Sciences - Special issue on STOC 2000
Algebraic proof systems over formulas
Theoretical Computer Science - Logic and complexity in computer science
Optimal proof systems imply complete sets for promise classes
Information and Computation
Theories with self-application and computational complexity
Information and Computation
Geometry of deduction via graphs of proofs
Logic for concurrency and synchronisation
Resolution lower bounds for perfect matching principles
Journal of Computer and System Sciences - Special issue on computational complexity 2002
On the complexity of the disjunction property in intuitionistic and modal logics
ACM Transactions on Computational Logic (TOCL)
Circuit principles and weak pigeonhole variants
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations
ACM Transactions on Computational Logic (TOCL)
LA, permutations, and the Hajós calculus
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
The strength of replacement in weak arithmetic
ACM Transactions on Computational Logic (TOCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
A Propositional Proof System with Quantification Over Permutations
Fundamenta Informaticae
On Rules and Parameter Free Systems in Bounded Arithmetic
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
The Polynomial and Linear Hierarchies in V0
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Many Facets of Complexity in Logic
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Some Theorems Concerning the Core Function
Concurrency, Graphs and Models
Proving Infinitude of Prime Numbers Using Binomial Coefficients
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The complexity of the Hajós calculus for planar graphs
Theoretical Computer Science
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games
ACM Transactions on Computational Logic (TOCL)
The deduction theorem for strong propositional proof systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Logical closure properties of propositional proof systems
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A tight Karp-Lipton collapse result in bounded arithmetic
ACM Transactions on Computational Logic (TOCL)
Information Processing Letters
The limits of tractability in resolution-based propositional proof systems
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
From feasible proofs to feasible computations
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A note on propositional proof complexity of some Ramsey-type statements
Archive for Mathematical Logic
Conservative fragments of $${{S}^{1}_{2}}$$ and $${{R}^{1}_{2}}$$
Archive for Mathematical Logic
Exponential lower bounds for AC0-Frege imply superpolynomial frege lower bounds
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Introduction to clarithmetic I
Information and Computation
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
Archive for Mathematical Logic
Proof complexity of propositional default logic
Archive for Mathematical Logic
A measure of logical inference and its game theoretical applications
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
The Complexity of Proving the Discrete Jordan Curve Theorem
ACM Transactions on Computational Logic (TOCL)
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Relativisation provides natural separations for resolution-based proof systems
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Logic of proofs for bounded arithmetic
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On the complexity of the sperner lemma
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Forcing with random variables and proof complexity
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Disjoint NP-pairs from propositional proof systems
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Proof complexity of non-classical logics
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Different approaches to proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A propositional proof system for log space
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Representable disjoint NP-Pairs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Complexity of propositional proofs
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Proof complexity of propositional default logic
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
A note on SAT algorithms and proof complexity
Information Processing Letters
Short proofs for the determinant identities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On sequent systems and resolution for QBFs
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Short Propositional Refutations for Dense Random 3CNF Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A Propositional Proof System with Quantification Over Permutations
Fundamenta Informaticae
Hard instances of algorithms and proof systems
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Relativizing small complexity classes and their theories
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Some definitorial suggestions for parameterized proof complexity
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Real closures of models of weak arithmetic
Archive for Mathematical Logic
A saturation property of structures obtained by forcing with a compact family of random variables
Archive for Mathematical Logic
The complexity of theorem proving in autoepistemic logic
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Improved witnessing and local improvement principles for second-order bounded arithmetic
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |