Resolution cannot polynomially simulate compressed-BFS
- 1 May 2005
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 44 (1-2) , 121-156
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Solving difficult instances of boolean satisfiability in the presence of symmetryIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2003
- Solving graph optimization problems with ZBDDs2002
- Faster SAT and smaller BDDs via common function structure2002
- Multi-resolution on compressed sets of clauses2002
- A proof engine approach to solving combinational design automation problemsProceedings of the 39th conference on Design automation - DAC '02, 2002
- Resolution and Binary Decision Diagrams Cannot Simulate Each Other PolynomiallyLecture Notes in Computer Science, 2001
- An experimental study of a compressed indexInformation Sciences, 2001
- Two-level logic minimization: an overviewIntegration, 1994
- A machine program for theorem-provingCommunications of the ACM, 1962
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960