The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials.
Guy BreslerBrice HuangPublished in: FOCS (2022)
Keyphrases
- phase transition
- low degree
- random instances
- randomly generated
- random constraint satisfaction problems
- easy hard easy pattern
- satisfiability problem
- random sat
- term dnf
- constraint satisfaction
- sat problem
- np complete
- hard problems
- stochastic local search
- graph coloring
- combinatorial problems
- cellular automata
- relational learning
- np complete problems
- uniform distribution
- sat instances
- boolean satisfiability
- propositional satisfiability
- decision trees
- max sat
- orders of magnitude
- constraint satisfaction problems