On the survey-propagation equations for the random K-satisfiability problem
Giorgio ParisiPublished in: CoRR (2002)
Keyphrases
- query language
- satisfiability problem
- np complete
- phase transition
- temporal logic
- search algorithm
- sat problem
- database
- sat instances
- random sat
- stochastic local search algorithms
- randomly generated
- stochastic local search
- solving hard
- pspace complete
- random instances
- mazurkiewicz traces
- max sat
- finite domain
- decision procedures
- genetic algorithm