Complexity of 2D bootstrap percolation difficulty: Algorithm and NP-hardness

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

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Hartarsky, Ivailo, Tamás Róbert Mezei
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 30.11.2019
Predmet:	Algorithms Cellular automata Combinatorial analysis Percolation Two dimensional models Upper bounds
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!