Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Lower bounds to the size of constant-depth propositional proofs
Journal of Symbolic Logic
Exponential lower bounds for the pigeonhole principle
Computational Complexity
Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An exponential lower bound to the size of bounded depth Frege proofs of the Pigeonhole Principle
Random Structures & Algorithms
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
Computational Complexity
Some consequences of cryptographical conjectures for S12 and EF
Information and Computation - Special issue: logic and computational complexity
Lower bounds for the polynomial calculus
Computational Complexity
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
On reducibility and symmetry of disjoint NP pairs
Theoretical Computer Science - Mathematical foundations of computer science
No feasible interpolation for TC/sup 0/-Frege proofs
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Pseudorandom Generators in Propositional Proof Complexity
SIAM Journal on Computing
Non-delta-function electronic spectral densities in individual quantum dots
Microelectronics Journal
The complexity of the pigeonhole principle
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Lower bounds of static lovász-schrijver calculus proofs for tseitin tautologies
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Complexity of propositional proofs
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
| Hi-index | 0.00 |