Complexity of two-dimensional bootstrap percolation difficulty: algorithm and NP-hardness

View/ Open
Date
2020Dewey
AnalyseSujet
decidable; bootstrap percolation; critical models; difficulty; complexity; NP-hardJournal issue
SIAM Journal on Discrete MathematicsVolume
34Number
2Publication date
06-2020Article pages
1444-1459Publisher
SIAM - Society for Industrial and Applied MathematicsCollections
Metadata
Show full item recordAuthor
Hartarsky, Ivailo
60 CEntre de REcherches en MAthématiques de la DEcision [CEREMADE]
66 Département de Mathématiques et Applications - ENS Paris [DMA]
66 Département de Mathématiques et Applications - ENS Paris [DMA]
Mezei, Tamás Róbert
187934 Alfréd Rényi Institute of Mathematics