Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming.
Marijn HeuleHans van MaarenPublished in: SAT (2005)
Keyphrases
- phase transition
- random sat
- linear programming
- lower bound
- max sat
- random constraint satisfaction problems
- random instances
- np hard
- objective function
- satisfiability problem
- constraint satisfaction
- optimal solution
- upper bound
- sat problem
- combinatorial problems
- linear program
- np complete
- randomly generated
- branch and bound
- graph coloring
- branch and bound algorithm
- cellular automata
- hard problems
- stochastic local search
- np complete problems
- dynamic programming
- boolean satisfiability
- mathematical programming
- constraint propagation
- search space