Journal of the ACM (JACM)
Many hard examples for resolution
Journal of the ACM (JACM)
Resolution proofs of generalized pigeonhole principles. (Note)
Theoretical Computer Science
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A machine program for theorem-proving
Communications of the ACM
Resolution and the Weak Pigeonhole Principle
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Simplified and improved resolution lower bounds
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Space complexity in propositional calculus
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
A sharp threshold in proof complexity
STOC '01 Proceedings of the thirty-third 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
Information and Computation
Size space tradeoffs for resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resolution lower bounds for the weak pigeonhole principle
STOC '02 Proceedings of the thiry-fourth 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
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
A spectral technique for random satisfiable 3CNF formulas
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Homogenization and the Polynominal Calculus
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Resolution Complexity of Random Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Proof Complexity of Pigeonhole Principles
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Lower Bounds for Space in Resolution
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Random CNF's are Hard for the Polynomial Calculus
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Space complexity of random formulae in resolution
Random Structures & Algorithms
Resolution and binary decision diagrams cannot simulate each other polynomially
Discrete Applied Mathematics - The renesse issue on satisfiability
Mutilated chessboard problem is exponentially hard for resolution
Theoretical Computer Science
Homogenization and the polynomial calculus
Computational Complexity
Hard examples for the bounded depth Frege proof system
Computational Complexity
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Random Structures & Algorithms
The complexity of properly learning simple concept classes
Journal of Computer and System Sciences
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Understanding the power of clause learning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Optimality of size-degree tradeoffs for polynomial calculus
ACM Transactions on Computational Logic (TOCL)
Clause-learning algorithms with many restarts and bounded-width resolution
Journal of Artificial Intelligence Research
The Depth of Resolution Proofs
Studia Logica
Width versus size in resolution proofs
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Lower bounds for width-restricted clause learning on small width formulas
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A dichotomy for local small-bias generators
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Strong ETH holds for regular resolution
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The complexity of proving that a graph is ramsey
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |