2 search results - page 1 / 1 » Computational Complexity of Avalanches in the Kadanoff two-d... |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
ACRI
2010
Springer
13 years 3 months ago
2010
Springer
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...