Satisfiability Coding Lemma

@article{Paturi1997SatisfiabilityCL,
  title={Satisfiability Coding Lemma},
  author={Ramamohan Paturi and Pavel Pudl{\'a}k and Francis Zane},
  journal={Proceedings 38th Annual Symposium on Foundations of Computer Science},
  year={1997},
  pages={566-574}
}
  • R. PaturiP. PudlákF. Zane
  • Published 19 October 1997
  • Computer Science
  • Proceedings 38th Annual Symposium on Foundations of Computer Science
We present and analyze two simple algorithms for finding satisfying assignments of /spl kappa/-CNFs (Boolean formulae in conjunctive normal form with at most /spl kappa/ literals per clause). The first is a randomized algorithm which, with probability approaching 1, finds a satisfying assignment of a satisfiable /spl kappa/-CNF formula F in time O(n/sup 2/|F|2/sup n-n//spl kappa//). The second algorithm is deterministic, and its running time approaches 2/sup n-n/2/spl kappa// for large n and… 

Tables from this paper

The complexity of unique k-SAT: an isolation lemma for k-CNFs

The main technical result is an isolation lemma for k-CNFs, which shows that a given satisfiable k- CNF can be efficiently probabilistically reduced to a uniquely satisfiability k-SAT, with nontrivial, albeit exponentially small, success probability.

Algorithms and extremal properties of SAT and CSP

The deterministic algorithm for satisfiability and constraint satisfaction is improved, ultimately closing the gap to Schöning’s random walk algorithm up to a subexponential factor.

An improved exponential-time algorithm for k-SAT

It is shown that, for each k, the running time of ResolveSat on a k-CNF formula is significantly better than 2/sup n/, even in the worst case, and the idea of succinctly encoding satisfying solutions can be applied to obtain lower bounds on circuit site.

An Improved Exponential-Time Algorithm for k-SAT

It is shown that, for each k, the running time of ResolveSat on a k-CNF formula is significantly better than 2/sup n/, even in the worst case, and the idea of succinctly encoding satisfying solutions can be applied to obtain lower bounds on circuit site.

Faster Random k-CNF Satisfiability

An algorithm to solve the problem of Boolean CNF-Satisfiability when the input formula is chosen randomly by counting how many clauses are satisfied by each randomly sampled assignment, and only search in the neighborhoods of assignments with abnormally many satisfied clauses is described.

Improved Exponential Algorithms for SAT and ClSP

The PPSZ algorithm is re-analyzed and it is shown that the bounds shown in the case where the input formula has at most one satisfying assignment (Unique k-SAT) hold in general, which was previously only known for k ≥ 5.

Complexity of k-SAT

  • R. ImpagliazzoR. Paturi
  • Mathematics, Computer Science
    Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)
  • 1999
This paper shows that s/sub k/ is an increasing sequence assuming ETH for k-SAT, and shows that d>0.1/s/sub /spl infin// is the limit of s/ sub k/.

Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability

  • R. Santhanam
  • Computer Science, Mathematics
    2010 IEEE 51st Annual Symposium on Foundations of Computer Science
  • 2010
It is shown that every function computable by linear-size formulae can be represented by decision trees of size $2^{n - \Omega(n)}$.

A Randomized Algorithm for 3-SAT

Two simple randomized algorithms PPZ and DEL are proposed for k-SAT and it is shown that when the average number of clauses for a variable that appear as unique true literals in one or more critical clauses in $$phi}$$ is between 1 and 2/(3 · log (3/2)), combined algorithm performs better than the PPZ algorithm.

The Complexity of Satisfiability of Small Depth Circuits

An improved randomized algorithm for the satisfiability problem for circuits of constant depth d and a linear number of gates cn is shown: for each d and c, the running time is 2(1 ? ?)n where the improvement $\delta\geq 1/O(c^{2-2-1}\lg^{3\cdot 2^{d-2}- 2}c)$, and the constant in the big-Oh depends only on d.
...

References

SHOWING 1-10 OF 22 REFERENCES

An Improved Exponential-Time Algorithm for k-SAT

It is shown that, for each k, the running time of ResolveSat on a k-CNF formula is significantly better than 2/sup n/, even in the worst case, and the idea of succinctly encoding satisfying solutions can be applied to obtain lower bounds on circuit site.

A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems

This analysis shows that for any satisfiable k-CNF formula with n variables this process has to be repeated only t times, on the average, to find a satisfying assignment, where t is within a polynomial factor of(2(1 1=k)).

Exponential lower bounds for depth 3 Boolean circuits

The main tool is a theorem that shows that any circuit on n variables that accepts a inputs and has size s must be constant on a projection of dimension at least log(a/s)log n.

Solving satisfiability in less than 2n steps

Number of Models and Satisfiability of Sets of Clauses

Top-down lower bounds for depth 3 circuits

This is the first simple proof of a strong lower bound by a top-down argument for non-monotone circuits and proves that depth 3 AND-OR-NOT circuits that compute PARITY resp.

Bounded Arithmetic and Lower Bounds in Boolean Complexity

This work studies the question of provability of lower bounds on the complexity of explicitly given Boolean functions in weak fragments of Peano Arithmetic and gives a more constructive version of the proof of Hastad Switching Lemma.

Algebraic methods in the theory of lower bounds for Boolean circuit complexity

It is proved that depth k circuits with gates NOT, OR and MODp where p is a prime require Exp(&Ogr;(n1/2k)) gates to calculate MODr functions for any r ≠ pm.

Graph-Theoretic Arguments in Low-Level Complexity

One approach to understanding complexity issues for certain easily computable natural functions is surveyed, and the notion of rigidity does offer for the first time a reduction of relevant computational questions to noncomputional properties.

The complexity of theorem-proving procedures

  • S. Cook
  • Mathematics, Computer Science
    STOC
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a