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
Pré-Publication, Document De Travail 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 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.
Fichier principal
Vignette du fichier
KSPMv3.pdf (296.4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00524176 , version 1 (07-10-2010)

Identifiants

Citer

Eric Goles Chacc, Bruno Martin. Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model. 2010. ⟨hal-00524176⟩
100 Consultations
40 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More