3

Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard

Bootstrap percolation is a class of cellular automata with random initial state. Two-dimensional bootstrap percolation models have three universality classes, the most studied being the 'critical' one. For this class the scaling of the quantity of …