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...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Hartarsky, Ivailo, Tamás Róbert Mezei
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 30.11.2019
Subjects:	Algorithms Cellular automata Combinatorial analysis Percolation Two dimensional models Upper bounds
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!