Proof of a Phase Transition in Probabilistic Cellular Automata.
Damien RegnaultPublished in: Developments in Language Theory (2013)
Keyphrases
- cellular automata
- phase transition
- randomly generated
- satisfiability problem
- random instances
- cellular automata model
- cellular automaton
- graph coloring
- hard problems
- lattice gas
- random graphs
- traffic flow
- chaotic dynamics
- discrete dynamical systems
- sat problem
- constraint satisfaction
- np complete
- np complete problems
- pattern formation
- cellular automaton model
- random constraint satisfaction problems
- pedestrian dynamics