Timed prediction problem for sandpile models

DOI10.1007/978-3-032-01570-9_14MaRDI QIDQ6860449zbMATH OpenFDO

Authors Pablo Concha-Vega, Kévin Perrot

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01570-9_14

zbMATH Keywords

\textsf{P}-completenessdiscrete dynamical systemsandpile models

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Cites work

• Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models
• Crossing information in two-dimensional sandpiles
• How hard is it to predict sandpiles on lattices? A survey
• scientific article; zbMATH DE number 1731510 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• On the complexity of two-dimensional signed majority cellular automata
• On the computational complexity of the freezing non-strict majority automata
• The complexity of the bootstraping percolation and other problems
• The computational complexity of sandpiles

This page was built for publication: Timed prediction problem for sandpile models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6860449)