On the black-box complexity of Sperner's Lemma

10.1007/s00224-008-9121-2

Saved in:
Bibliographic Details
Main Authors: Friedl, K., Ivanyos, G., Santha, M., Verhoeven, Y.F.
Other Authors: CENTRE FOR QUANTUM TECHNOLOGIES
Format: Article
Published: 2014
Subjects:
Online Access:http://scholarbank.nus.edu.sg/handle/10635/112475
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
id sg-nus-scholar.10635-112475
record_format dspace
spelling sg-nus-scholar.10635-1124752023-10-30T07:47:51Z On the black-box complexity of Sperner's Lemma Friedl, K. Ivanyos, G. Santha, M. Verhoeven, Y.F. CENTRE FOR QUANTUM TECHNOLOGIES Deterministic algorithm Probabilistic and quantum lower bound Query complexity Sperner's lemma 10.1007/s00224-008-9121-2 Theory of Computing Systems 45 3 629-646 2014-11-28T05:01:48Z 2014-11-28T05:01:48Z 2009-07 Article Friedl, K., Ivanyos, G., Santha, M., Verhoeven, Y.F. (2009-07). On the black-box complexity of Sperner's Lemma. Theory of Computing Systems 45 (3) : 629-646. ScholarBank@NUS Repository. https://doi.org/10.1007/s00224-008-9121-2 14324350 http://scholarbank.nus.edu.sg/handle/10635/112475 000267899000012 Scopus
institution National University of Singapore
building NUS Library
continent Asia
country Singapore
Singapore
content_provider NUS Library
collection ScholarBank@NUS
topic Deterministic algorithm
Probabilistic and quantum lower bound
Query complexity
Sperner's lemma
spellingShingle Deterministic algorithm
Probabilistic and quantum lower bound
Query complexity
Sperner's lemma
Friedl, K.
Ivanyos, G.
Santha, M.
Verhoeven, Y.F.
On the black-box complexity of Sperner's Lemma
description 10.1007/s00224-008-9121-2
author2 CENTRE FOR QUANTUM TECHNOLOGIES
author_facet CENTRE FOR QUANTUM TECHNOLOGIES
Friedl, K.
Ivanyos, G.
Santha, M.
Verhoeven, Y.F.
format Article
author Friedl, K.
Ivanyos, G.
Santha, M.
Verhoeven, Y.F.
author_sort Friedl, K.
title On the black-box complexity of Sperner's Lemma
title_short On the black-box complexity of Sperner's Lemma
title_full On the black-box complexity of Sperner's Lemma
title_fullStr On the black-box complexity of Sperner's Lemma
title_full_unstemmed On the black-box complexity of Sperner's Lemma
title_sort on the black-box complexity of sperner's lemma
publishDate 2014
url http://scholarbank.nus.edu.sg/handle/10635/112475
_version_ 1781789078525575168