Computational Complexity of Avalanches in the Kadanoff Two-dimensional Sandpile Model - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Computational Complexity of Avalanches in the Kadanoff Two-dimensional Sandpile Model

Résumé

In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circuit value problem by building logic gates and wires which work with configurations in KSPM. The proof is also related to the known prediction problem for sandpile which is in NC for one-dimensional sandpiles and is P-complete for dimension 3 or greater. The computational complexity of the prediction problem remains open for two-dimensional sandpiles.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
KSPM.pdf (361.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00542340 , version 1 (02-12-2010)

Identifiants

  • HAL Id : hal-00542340 , version 1

Citer

Eric Goles, Bruno Martin. Computational Complexity of Avalanches in the Kadanoff Two-dimensional Sandpile Model. Journées Automates Cellulaires 2010, Dec 2010, Turku, Finland. pp.121-132. ⟨hal-00542340⟩
85 Consultations
92 Téléchargements

Partager

Gmail Facebook X LinkedIn More