Lower bounds to randomized algorithms for graph properties (Q808708)
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: Lower bounds to randomized algorithms for graph properties |
scientific article; zbMATH DE number 4211510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds to randomized algorithms for graph properties |
scientific article; zbMATH DE number 4211510 |
Statements
Lower bounds to randomized algorithms for graph properties (English)
0 references
1991
0 references
n-vertex graphs
0 references
randomized algorithm
0 references
nontrivial monotone graph property
0 references
0 references
0.9163015484809875
0 references
0.912198841571808
0 references
0.8986069560050964
0 references
0.8788526654243469
0 references
