A Random NP-Complete Problem for Inversion of 2D Cellular Automata.
Bruno DurandPublished in: STACS (1995)
Keyphrases
- cellular automata
- np complete
- randomly generated
- np hard
- cellular automaton
- satisfiability problem
- computational complexity
- cellular automata model
- phase transition
- path planner
- pattern formation
- cellular automaton model
- lattice gas
- reaction diffusion
- polynomial time complexity
- chaotic dynamics
- image reconstruction
- hidden markov models