The complexity of the bootstraping percolation and other problems (Q393154)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of the bootstraping percolation and other problems |
scientific article; zbMATH DE number 6246056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the bootstraping percolation and other problems |
scientific article; zbMATH DE number 6246056 |
Statements
The complexity of the bootstraping percolation and other problems (English)
0 references
16 January 2014
0 references
computational complexity
0 references
bootstrapping percolation
0 references
parallel algorithms
0 references
P-completeness
0 references
majority functions
0 references
0.8152369856834412
0 references
0.8065167665481567
0 references
0.7921063899993896
0 references
0.7886844277381897
0 references
