Strong ETH holds for regular resolution

Authors:
Christopher Beck;Russell Impagliazzo
Affiliations:
Princeton University, Princeton, NJ, USA;University of California, San Diego, La Jolla, USA
Venue:
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Year:
2013

Citing 25
Cited 0

Hard examples for resolution

Journal of the ACM (JACM)
Many hard examples for resolution

Journal of the ACM (JACM)
A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth 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
Linear gaps between degrees for the polynomial calculus modulo distinct primes

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An exponential lower bound for the size of monotone real circuits

Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
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 the polynomial calculus and the Gröbner basis algorithm

Computational Complexity
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 machine program for theorem-proving

Communications of the ACM
On the complexity of K-SAT

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
On the bottleneck counting argument

Theoretical Computer Science
Linear lower bound on degrees of positivstellensatz calculus proofs for the parity

Theoretical Computer Science
Resolution lower bounds for the weak pigeonhole principle

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Satisfiability Coding Lemma

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Random CNF's are Hard for the Polynomial Calculus

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems

FOCS '99 Proceedings of the 40th 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
An improved exponential-time algorithm for k-SAT

Journal of the ACM (JACM)
Linear Level Lasserre Lower Bounds for Certain k-CSPs

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Non-uniform ACC Circuit Lower Bounds

CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
A satisfiability algorithm for AC0

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We obtain asymptotically sharper lower bounds on resolution complexity for k-CNF's than was known previously. We show that for any large enough k there are k-CNF's which require resolution width (1-~O(k-1/4))n, regular resolution size 2(1-~O(k-1/4))n, and general resolution size (3/2)(1-~O(k-1/4))n.