Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights.
Hans van MaarenJoost P. WarnersPublished in: Ann. Math. Artif. Intell. (2003)
Keyphrases
- satisfiability problem
- solving hard
- stochastic local search
- np complete
- sat instances
- finite domain
- temporal logic
- graph coloring problems
- search algorithm
- phase transition
- davis putnam logemann loveland
- stochastic local search algorithms
- combinatorial problems
- sat problem
- constraint satisfaction problems
- pspace complete
- constraint programming
- max sat
- mazurkiewicz traces
- randomly generated
- boolean formula
- combinatorial optimization
- constraint satisfaction