Lower Bounds and Hardness Magnification for Sublinear-Time Shrinking Cellular Automata.
Augusto ModanesePublished in: CoRR (2020)
Keyphrases
- cellular automata
- lower bound
- np hard
- phase transition
- upper bound
- worst case
- cellular automaton
- branch and bound algorithm
- super resolution
- objective function
- chaotic dynamics
- cellular automata model
- lattice gas
- optimal solution
- learning theory
- binary search trees
- cellular automaton model
- traffic flow
- high resolution
- neural network
- vision system
- potts model
- pattern formation
- data structure
- computational complexity
- predator prey
- path planner
- sufficient conditions