A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems

@inproceedings{Schning1999APA,
  title={A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems},
  author={Uwe Sch{\"o}ning},
  booktitle={FOCS},
  year={1999}
}
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch paradigm (cf. [9]): randomly guess an initial assignment and then, guided by those clauses (constraints) that are not satisfied, by successively choosing a random literal from such a clause and flipping the corresponding bit, try to find a satisfying assignment. If no satisfying assignment is found after O(n) steps… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 231 CITATIONS, ESTIMATED 30% COVERAGE

231 Citations

01020'99'03'08'13'18
Citations per Year
Semantic Scholar estimates that this publication has 231 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

ed.):Algorithms and Theory of Computation Handbook

  • M. J. Attallah
  • 1999
1 Excerpt

ák: Satisfiability - Algorithms and Logic

  • P. Pudl
  • Proceedings Mathem. Foundations of Computer…
  • 1998
1 Excerpt

Pure literal look ahead: an O(1:497) 3-satisfiability algorithm.Proc. of the Workshop on Satisfiability

  • I. Schiermeyer
  • Universita degli Studi,
  • 1996

Raghavan: Randomized Algorithms

  • P. R. Motwani
  • 1995
1 Excerpt

Solving 3-satisfiability in less than 1.579 steps,Selected papers from CSL

  • I. Schiermeyer
  • 1993

Similar Papers

Loading similar papers…