A Random NP-Complete Problem for Inversion of 2D Cellular Automata.
Bruno DurandPublished in: Theor. Comput. Sci. (1995)
Keyphrases
- cellular automata
- np complete
- randomly generated
- cellular automaton
- np hard
- satisfiability problem
- phase transition
- computational complexity
- predator prey
- discrete dynamical systems
- reaction diffusion
- image reconstruction
- path planner
- lattice gas
- cellular automaton model
- cellular automata model
- polynomial time complexity
- chaotic dynamics
- action selection
- dynamical systems
- sufficient conditions