Sciweavers

CIE
2005
Springer

The Computational Complexity of One-Dimensional Sandpiles

14 years 5 months ago
The Computational Complexity of One-Dimensional Sandpiles
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.
Peter Bro Miltersen
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where CIE
Authors Peter Bro Miltersen
Comments (0)