Finite-Size Scaling in Random $K$-Satisfiability Problems
Sang Hoon LeeMeesoon HaChanil JeonHawoong JeongPublished in: CoRR (2010)
Keyphrases
- satisfiability problem
- np complete
- phase transition
- search algorithm
- sat problem
- temporal logic
- randomly generated
- random sat
- solving hard
- pspace complete
- stochastic local search
- computational complexity
- constraint satisfaction
- orders of magnitude
- propositional satisfiability
- upper bound
- finite domain
- np hard
- davis putnam