Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Pseudorandom generators in propositional proof complexity
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Resolution Lower Bounds for Perfect Matching Principles
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Complexity of propositional proofs under a promise
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.89 |
We prove that there is a polynomial time substitution (y"1,...,y"n):=g(x"1,...,x"k) with k@?n such that whenever the substitution instance A(g(x"1,...,x"k)) of a 3DNF formula A(y"1,...,y"n) has a short resolution proof it follows that A(y"1,...,y"n) is a tautology. The qualification ''short'' depends on the parameters k and n.