The satisfiability threshold for randomly generated binary constraint satisfaction problems.
Alan M. FriezeMichael MolloyPublished in: Random Struct. Algorithms (2006)
Keyphrases
- randomly generated
- np complete
- phase transition
- sat problem
- sat instances
- satisfiability problem
- stochastic local search
- random instances
- boolean functions
- branch and bound algorithm
- computational complexity
- constraint satisfaction
- constraint satisfaction problems
- np hard
- hard problems
- constraint problems
- genetic algorithm
- combinatorial problems
- simplex algorithm