Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
- Cite this paper as:
- Formenti E., Perrot K., Rémila É. (2015) Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles. In: Isokawa T., Imai K., Matsui N., Peper F., Umeo H. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2014. Lecture Notes in Computer Science, vol 8996. Springer, Cham
In this paper we prove that the general avalanche problemAP is in NC for the Kadanoff sandpile model in one dimension, answering an open problem of . Thus adding one more item to the (slowly) growing list of dimension sensitive problems since in higher dimensions the problem is P-complete (for monotone sandpiles).