Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles

DOI10.1007/978-3-319-18812-6_2zbMath1432.68275arXiv1803.05498OpenAlexW1124998092MaRDI QIDQ5501609

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

Publication date: 4 August 2015

Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.05498

zbMATH Keywords

computational complexitydiscrete dynamical systemssandpile modelsdimension sensitive problems

Mathematics Subject Classification ID

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

Related Items (4)

Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models ⋮ Strong emergence of wave patterns on Kadanoff sandpiles ⋮ Sandpile toppling on Penrose tilings: identity and isotropic dynamics ⋮ A survey on the stability of (extended) linear Sand Pile model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Crossing information in two-dimensional sandpiles
• Fixed-point forms of the parallel symmetric sandpile model
• Avalanche Structure in the Kadanoff Sand Pile Model
• Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence
• SAND PILE AS A UNIVERSAL COMPUTER
• The structure of a linear chip firing game and related models

This page was built for publication: Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles