New Computational Paradigms

DOI10.1007/B136981MaRDI QIDQ5717059zbMATH OpenOpenAlexFDO

Authors Peter Bro Miltersen

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136981

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The computational complexity of one-dimensional sandpiles
• The computational complexity of sandpiles
• On the complexity of sandpile prediction problems
• How hard is it to predict sandpiles on lattices? A survey
• Computational complexity of avalanches in the Kadanoff sandpile model

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: New Computational Paradigms

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