Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles
classification
💻 cs.CC
cond-mat.stat-mech
keywords
problemavalanchedimensionkadanoffsandpilesaddingansweringcomplexity
pith:ZGDUW54R Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{ZGDUW54R}
Prints a linked pith:ZGDUW54R badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.