The Computational Complexity of One-Dimensional Sandpiles

13 years 10 months ago

Download www.daimi.au.dk

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

Real-time Traffic

CIE 2005 | One-dimensional Sandpile Prediction | Upper Bound |

claim paper

» The Complexity of ThreeDimensional Critical Avalanches

» NumericSymbolic Algorithms for Evaluating OneDimensional Algebraic Sets

» Iterative Optimization in the Polyhedral Model Part I OneDimensional Time

» A New Complex Basis for Implicit Polynomial Curves and its Simple Exploitation for Pose Es...

» An Efficient and Robust Technique for Region Based Shape Representation and Retrieval

» Pathsampling for statedependent importance sampling

» Tilt to Scroll Evaluating a Motion Based Vibrotactile Mobile Interface

» Approximating loops in a shortest homology basis from point data

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CIE
Authors	Peter Bro Miltersen

Comments (0)

Sciweavers

The Computational Complexity of One-Dimensional Sandpiles

CIE 2005 | One-dimensional Sandpile Prediction | Upper Bound |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers