Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles

Abstract : 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).
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01313306
Contributeur : Enrico Formenti <>
Soumis le : lundi 9 mai 2016 - 17:47:11
Dernière modification le : dimanche 15 octobre 2017 - 22:44:08

Identifiants

Citation

Enrico Formenti, Eric Rémila, Perrot Kevin. Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles. AUTOMATA 2014, Jul 2014, Himeji, Japan. Springer, 8996, pp.21-30, 2014, Lecture Notes in Computer Science. 〈http://link.springer.com/chapter/10.1007%2F978-3-319-18812-6_2〉. 〈10.1007/978-3-319-18812-6_2〉. 〈hal-01313306〉

Partager

Métriques

Consultations de la notice

101