Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles

03/14/2018
by   Enrico Formenti, et al.
0

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 Formenti, Goles and Martin in 2010. 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).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/27/2023

A Characterization of Complexity in Public Goods Games

We complete the characterization of the computational complexity of equi...
research
06/09/2020

A note on the growth of the dimension in complete simple games

The remoteness from a simple game to a weighted game can be measured by ...
research
02/15/2022

The aperiodic Domino problem in higher dimension

The classical Domino problem asks whether there exists a tiling in which...
research
12/23/2019

On the Scalability of the Parallel Schwarz Method in One-Dimension

In contrast with classical Schwarz theory, recent results in computation...
research
07/24/2023

As Time Goes By: Adding a Temporal Dimension Towards Resolving Delegations in Liquid Democracy

In recent years, the study of various models and questions related to Li...
research
06/01/2018

The Complexity of Bisimulation and Simulation on Finite Systems

In this paper the computational complexity of the (bi)simulation problem...
research
05/31/2023

Deep Stochastic Mechanics

This paper introduces a novel deep-learning-based approach for numerical...

Please sign up or login with your details

Forgot password? Click here to reset