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:	Deterministic algorithm Probabilistic and quantum lower bound Query complexity Sperner's lemma
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

Description
Summary:	10.1007/s00224-008-9121-2

Similar Items