The computational complexity of one-dimensional sandpiles

Authors:
Peter Bro Miltersen
Affiliations:
Dept. of Computer Science, University of Aarhus, Denmark
Venue:
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Year:
2005

Citing 4
Cited 0

Computational limitations of small-depth circuits

Computational limitations of small-depth circuits
Computation at the edge of chaos: phase transitions and emergent computation

CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
On uniformity within NC1

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
On the Tape Complexity of Deterministic Context-Free Languages

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that the one-dimensional sandpile prediction problem is in AC1. The previously best known upper bound on the ACi-scale was AC2. We also prove that it is not in AC1−−ε for any constant ε0.