International Workshop on Cellular Automata and Discrete Complex Systems

AUTOMATA 2014: Cellular Automata and Discrete Complex Systems pp 21-30

Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles

Conference paper

DOI: 10.1007/978-3-319-18812-6_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8996)
Cite this paper as:
Formenti E., Perrot K., Rémila É. (2015) Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles. In: Isokawa T., Imai K., Matsui N., Peper F., Umeo H. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2014. Lecture Notes in Computer Science, vol 8996. Springer, Cham

Abstract

In this paper we prove that the general avalanche problemAP is in NC  for the Kadanoff sandpile model in one dimension, answering an open problem of [2]. Thus adding one more item to the (slowly) growing list of dimension sensitive problems since in higher dimensions the problem is P-complete (for monotone sandpiles).

Keywords

Sandpile models Discrete dynamical systems Computational complexity Dimension sensitive problems 

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Enrico Formenti
    • 1
  • Kévin Perrot
    • 1
    • 2
    • 3
  • Éric Rémila
    • 4
  1. 1.Laboratoire I3S (UMR 6070 - CNRS)Université Nice Sophia AntipolisSophia Antipolis CedexFrance
  2. 2.Université de Lyon - LIP (UMR 5668 - CNRS - ENS de Lyon - Université Lyon 1)Lyon Cedex 7France
  3. 3.Universidad de Chile - DII - DIM - CMM (UMR 2807 - CNRS)SantiagoChile
  4. 4.Université de Lyon - GATE LSE (UMR 5824 - CNRS - Université Lyon 2)Saint-etienne Cedex 2France

Personalised recommendations