The computational complexity of one-dimensional sandpiles
From MaRDI portal
Recommendations
Cited in
(6)- Freezing sandpiles and Boolean threshold networks: equivalence and complexity
- Sandpile toppling on Penrose tilings: identity and isotropic dynamics
- The computational complexity of one-dimensional sandpiles
- On the complexity of sandpile prediction problems
- How hard is it to predict sandpiles on lattices? A survey
- Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
This page was built for publication: The computational complexity of one-dimensional sandpiles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717059)