Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles

Résumé

In this paper we prove that the general avalanche problem AP 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).

Dates et versions

hal-01313306 , version 1 (09-05-2016)

Identifiants

Citer

Enrico Formenti, Eric Rémila, Kévin Perrot. Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles. AUTOMATA 2014, Teijiro Isokawa; Katsunobu Imai; Nobuyuki Matsui; Ferdinand Peper; Hiroshi Umeo, Jul 2014, Himeji, Japan. pp.21-30, ⟨10.1007/978-3-319-18812-6_2⟩. ⟨hal-01313306⟩
327 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More