Journal of the ACM (JACM)
Many hard examples for resolution
Journal of the ACM (JACM)
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Short proofs are narrow—resolution made simple
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
A machine program for theorem-proving
Communications of the ACM
Solving 3-Satisfiability in Less Then 1, 579n Steps
CSL '92 Selected Papers from the Workshop on Computer Science Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Simplified and improved resolution lower bounds
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On the Complexity of Resolution with Bounded Conjunctions
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A combinatorial characterization of treelike resolution space
Information Processing Letters
Resolution lower bounds for perfect matching principles
Journal of Computer and System Sciences - Special issue on computational complexity 2002
On the complexity of resolution with bounded conjunctions
Theoretical Computer Science
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Journal of Algorithms
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Journal of Automated Reasoning
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Information Processing Letters
Parameterized complexity of DPLL search procedures
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
The Depth of Resolution Proofs
Studia Logica
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Finding kernels or solving SAT
Journal of Discrete Algorithms
SAT'05 Proceedings of the 8th 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
Clique problem, cutting plane proofs and communication complexity
Information Processing Letters
Game characterizations and the PSPACE-completeness of tree resolution space
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Strong ETH holds for regular resolution
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Parameterized Complexity of DPLL Search Procedures
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.02 |