论文信息 - Two Notes on the Computational Complexity of One-Dimensional Sandpiles

Two Notes on the Computational Complexity of One-Dimensional Sandpiles

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−epsilon for any constant epsilon > 0.

Peter Bro Miltersen

[1] Andrew D. Gordon,et al. Compilation and Equivalence of Imperative Objects (Revised Report) , 1998 .

[2] Mogens Nielsen,et al. Hereditary History Preserving Simulation is Undecidable , 1999 .

[3] Walter L. Ruzzo,et al. Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[4] Davide Sangiorgi,et al. Imperative objects and mobile processes , 1998, PROCOMET.

[5] Luca Aceto,et al. Testing Hennessy-Milner Logic with Recursion , 1998, FoSSaCS.

[6] Martin Nilsson,et al. The Computational Complexity of Sandpiles , 1999 .

[7] J. Håstad. Computational limitations of small-depth circuits , 1987 .

[8] Olivier Danvy,et al. Lambda-dropping: transforming recursive equations into programs with block structure , 1997, Theor. Comput. Sci..

[9] N. Immerman,et al. On uniformity within NC 1 . , 1988 .

[10] Peter Krogsgaard Jensen. Automated Modeling of Real-Time Implementation , 1998 .

[11] Ivan Hal Sudborough,et al. On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.

[12] Neil Immerman,et al. On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[13] Ivan Damgård. An error in the mixed adversary protocol by Fitzi, Hirt and Maurer , 1999, IACR Cryptol. ePrint Arch..

[14] Julian C. Bradfield. Fixpoint alternation: Arithmetic, transition systems, and the binary tree , 1999, RAIRO Theor. Informatics Appl..