Two Notes on the Computational Complexity of One-Dimensional Sandpiles
DOI:
https://doi.org/10.7146/brics.v6i3.20060Resumé
We prove that the one-dimensional sandpile prediction problem isin AC1. The previously best known upper bound on the ACi-scale
was AC2. We also prove that it is not in AC1−epsilon for any constant
epsilon > 0.
Downloads
Publiceret
1999-01-03
Citation/Eksport
Miltersen, P. B. (1999). Two Notes on the Computational Complexity of One-Dimensional Sandpiles. BRICS Report Series, 6(3). https://doi.org/10.7146/brics.v6i3.20060
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).