Phase Transitions of the Typical Algorithmic Complexity of the Random Satisfiability Problem Studied with Linear Programming.
Hendrik SchaweRoman BleimAlexander K. HartmannPublished in: CoRR (2017)
Keyphrases
- satisfiability problem
- phase transition
- linear programming
- random instances
- random constraint satisfaction problems
- randomly generated
- random sat
- constraint satisfaction
- sat problem
- np complete
- combinatorial problems
- search algorithm
- stochastic local search algorithms
- sat instances
- cellular automata
- temporal logic
- np complete problems
- stochastic local search
- constraint propagation
- random graphs
- max sat
- graph coloring
- hard problems
- boolean satisfiability
- np hard
- dynamic programming
- objective function
- conjunctive normal form
- davis putnam
- optimal solution
- propositional satisfiability
- constraint satisfaction problems