On the black-box complexity of Sperner's Lemma (Q839637): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q125054626, #quickstatements; #temporary_batch_1712190744730 |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: quant-ph/0505185 / rank | |||
Normal rank | |||
Revision as of 17:09, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
