Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata.
Augusto ModanesePublished in: CSR (2021)
Keyphrases
- cellular automata
- lower bound
- np hard
- phase transition
- worst case
- upper bound
- branch and bound algorithm
- cellular automaton
- super resolution
- cellular automata model
- objective function
- computational complexity
- pattern formation
- binary search trees
- lattice gas
- chaotic dynamics
- discrete dynamical systems
- cellular automaton model
- reaction diffusion
- traffic flow
- learning theory
- high resolution
- optimal solution
- predator prey
- vc dimension
- mobile robot
- dynamic environments
- pedestrian dynamics
- neural network