Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness (Q5854892)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7321569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness |
scientific article; zbMATH DE number 7321569 |
Statements
Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness (English)
0 references
12 March 2021
0 references
bootstrap percolation
0 references
critical models
0 references
difficulty
0 references
complexity
0 references
NP-hardness
0 references
decidability
0 references
0 references
0.93134516
0 references
0.9087552
0 references
0.9086651
0 references
0.9007414
0 references
0 references
0.88284796
0 references
0.87463176
0 references
0.8745175
0 references
0 references
