On the probabilistic approach to the random satisfiability problem
Giorgio ParisiPublished in: CoRR (2003)
Keyphrases
- satisfiability problem
- np complete
- temporal logic
- search algorithm
- phase transition
- stochastic local search algorithms
- pspace complete
- sat problem
- mazurkiewicz traces
- random sat
- randomly generated
- sat instances
- solving hard
- np hard
- max sat
- decision procedures
- stochastic local search
- orders of magnitude
- knowledge representation