Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles
Computational Complexity
2018-03-16 v1 Statistical Mechanics
Abstract
In this paper we prove that the general avalanche problem AP is in NC, for the Kadanoff sandpile model in one dimension, answering an open problem of Formenti, Goles and Martin in 2010. 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).
Cite
@article{arxiv.1803.05498,
title = {Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles},
author = {Enrico Formenti and Kévin Perrot and Eric Rémila},
journal= {arXiv preprint arXiv:1803.05498},
year = {2018}
}