Journal of the ACM (JACM)
The complexity of Boolean functions
The complexity of Boolean functions
Many hard examples for resolution
Journal of the ACM (JACM)
Resolution proofs of generalized pigeonhole principles. (Note)
Theoretical Computer Science
Search Problems in the Decision Tree Model
SIAM Journal on Discrete Mathematics
Bounded arithmetic, propositional logic, and complexity theory
Bounded arithmetic, propositional logic, and complexity theory
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Lower Bounds for Deterministic and Nondeterministic Branching Programs
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Simplified and improved resolution lower bounds
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Short proofs are narrow—resolution made simple
STOC '99 Proceedings of the thirty-first 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
A new proof of the weak pigeonhole principle
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A lower bound for DLL algorithms for k-SAT (preliminary version)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Regular resolution lower bounds for the weak pigeonhole principle
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Information and Computation
Resolution lower bounds for the weak pigeonhole principle
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resolution Proofs of Matching Principles
Annals of Mathematics and Artificial Intelligence
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Proof Complexity of Pigeonhole Principles
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Monotone Proofs of the Pigeon Hole Principle
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A new proof of the weak Pigeonhole principle
Journal of Computer and System Sciences - Special issue on STOC 2000
Resolution lower bounds for the weak functional pigeonhole principle
Theoretical Computer Science - Logic and complexity in computer science
Resolution lower bounds for the weak pigeonhole principle
Journal of the ACM (JACM)
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Width versus size in resolution proofs
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |