Skip to main content
SpringerLink
Log in

The Computational Complexity of One-Dimensional Sandpiles

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We prove that the one-dimensional sandpile prediction problem is in LOGDCFL, a subset of AC1. The previously best known upper bound on the ACi-scale was AC2. Furthermore, we prove that the one-dimensional sandpile prediction problem is hard for TC0 and thus not in AC1-ε for any constant ε > 0.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Aarhus, IT-parken, Aabogade 34, DK 8200 Aarhus N, Denmark

    Peter Bro Miltersen

Authors
  1. Peter Bro Miltersen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Bro Miltersen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Miltersen, P. The Computational Complexity of One-Dimensional Sandpiles. Theory Comput Syst 41, 119–125 (2007). https://doi.org/10.1007/s00224-006-1341-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-006-1341-8

Keywords

Search

Navigation