A probabilistic algorithm for k-SAT and constraint satisfaction problems

@article{Schoning1999APA,
  title={A probabilistic algorithm for k-SAT and constraint satisfaction problems},
  author={T. Schoning},
  journal={40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)},
  year={1999},
  pages={410-414}
}
  • T. Schoning
  • Published 1999
  • Mathematics
  • 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
We present a simple probabilistic algorithm for solving k-SAT and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple local search paradigm (S. Minton et al., 1992): 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… Expand
Measurement-driven quantum computing: Performance of a 3-SAT solver
Improving PPSZ for 3-SAT using Critical Variables
Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding
3-Coloring in Time O(1.3289^n)
Improved upper bounds for 3-SAT
Algorithms for Sat and Upper Bounds on Their Complexity
WALCOM: Algorithms and Computation
Randomized algorithm for informative path planning with budget constraints
  • S. Arora, S. Scherer
  • Mathematics, Computer Science
  • 2017 IEEE International Conference on Robotics and Automation (ICRA)
  • 2017
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
Algorithms and Theory of Computation Handbook
  • M. Atallah
  • Computer Science
  • Chapman & Hall/CRC Applied Algorithms and Data Structures series
  • 1999
An improved exponential-time algorithm for k-SAT
Satisfiability - Algorithms and Logic
Satisfiability Coding Lemma
  • R. Paturi, P. Pudlák, F. Zane
  • Mathematics, Computer Science
  • Proceedings 38th Annual Symposium on Foundations of Computer Science
  • 1997
A New Approach on Solving 3-Satisfiability
3-coloring in time 0(1.3446/sup n/): a no-MIS algorithm
  • R. Beigel, D. Eppstein
  • Mathematics, Computer Science
  • Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995
Randomized Algorithms
Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems
Search methods for artificial intelligence
...
1
2
...