A new proof of the weak pigeonhole principle
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Hard examples for bounded depth frege
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
Proof Complexity of Pigeonhole Principles
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Improved bounds on the weak Pigeonhole principle and infinitely many primes from weaker axioms
Theoretical Computer Science - Mathematical foundations of computer science
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
Hard examples for the bounded depth Frege proof system
Computational Complexity
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
New Graph Calculi for Planar Non-3-Colorable Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games
ACM Transactions on Computational Logic (TOCL)
Twelve problems in proof complexity
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
A note on propositional proof complexity of some Ramsey-type statements
Archive for Mathematical Logic
Parameterized bounded-depth Frege is not optimal
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Algebraic proofs over noncommutative formulas
Information and Computation
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
Archive for Mathematical Logic
Proof complexity of non-classical logics
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Algebraic proofs over noncommutative formulas
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Parameterized Bounded-Depth Frege Is not Optimal
ACM Transactions on Computation Theory (TOCT)
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
Complexity of deep inference via atomic flows
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.00 |