Low-degree phase transitions for detecting a planted clique in sublinear time.
Jay MardiaKabir Aladin VerchandAlexander S. WeinPublished in: CoRR (2024)
Keyphrases
- phase transition
- low degree
- term dnf
- random constraint satisfaction problems
- constraint satisfaction
- satisfiability problem
- np complete
- randomly generated
- random instances
- relational learning
- random graphs
- hard problems
- sat problem
- graph coloring
- np complete problems
- cellular automata
- special case
- learning algorithm
- search space
- computational complexity
- training data