Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability.
Milos ChromýPetr KuceraPublished in: CoRR (2018)
Keyphrases
- phase transition
- constraint satisfaction
- random sat
- random instances
- satisfiability problem
- stochastic local search
- sat problem
- np complete
- randomly generated
- combinatorial problems
- random constraint satisfaction problems
- hard problems
- graph coloring
- cellular automata
- optimal solution
- np complete problems
- constraint satisfaction problems
- simulated annealing
- cnf formula
- constraint programming
- random graphs
- conjunctive normal form
- sat instances
- max sat
- orders of magnitude
- heuristic methods
- tabu search
- dynamic programming
- np hard