Homepage of T.R. Mezei
Homepage of T.R. Mezei
Home
Projects
Publications
Talks
Experience & Contests
Posts
Contact
CV
Light
Dark
Automatic
bootstrap percolation
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 …
Cite
×