Computational complexity of the avalanche problem for one dimensional decreasing sandpiles

MaRDI QIDQ5010301zbMATH OpenFDO

Authors Kévin Perrot, Eric Rémila, Enrico Formenti

Publication date 25 August 2021

Full work available at URL http://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-13-number-3-2018/jca-13-3-p-215-228/

zbMATH Keywords

computational complexitydimension-sensitive problemsdiscrete dynamical systemssandpile models

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)

Recommendations

• Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
• Computational complexity of avalanches in the Kadanoff sandpile model
• How hard is it to predict sandpiles on lattices? A survey
• Computing with sand: on the complexity of recognizing two-dimensional sandpile critical configurations
• On the complexity of sandpile critical avalanches

Cited in

(5)

• Sandpile toppling on Penrose tilings: identity and isotropic dynamics
• Computational complexity of avalanches in the Kadanoff sandpile model
• scientific article; zbMATH DE number 503444 (Why is no real title available?)
• Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
• Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models

This page was built for publication: Computational complexity of the avalanche problem for one dimensional decreasing sandpiles

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