It was "all" for "nothing": sharp phase transitions for noiseless discrete channels.
Jonathan Niles-WeedIlias ZadikPublished in: CoRR (2021)
Keyphrases
- phase transition
- constraint satisfaction
- random constraint satisfaction problems
- satisfiability problem
- combinatorial problems
- np complete
- randomly generated
- graph coloring
- random instances
- cellular automata
- hard problems
- np complete problems
- sat problem
- deep structure
- noisy data
- random graphs
- stochastic local search
- sat instances
- boolean formulae
- computational complexity