On the black-box complexity of Sperner's Lemma (Q839637)
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: On the black-box complexity of Sperner's Lemma |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the black-box complexity of Sperner's Lemma |
scientific article |
Statements
On the black-box complexity of Sperner's Lemma (English)
0 references
2 September 2009
0 references
query complexity
0 references
Sperner's Lemma
0 references
deterministic algorithm
0 references
probabilistic and quantum lower bound
0 references
0 references
0 references
0.9989797472953796
0 references
0.8760347366333008
0 references
0.821528971195221
0 references
0.8086643815040588
0 references
0.8052682280540466
0 references
