On the black-box complexity of Sperner's Lemma
10.1007/s00224-008-9121-2
Saved in:
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 |
Similar Items
-
The partition bound for classical communication complexity and query complexity
by: Jain, R., et al.
Published: (2013) -
Enhancing program verification with lemmas
by: Nguyen, H.H., et al.
Published: (2013) -
A Study on The Covering Lemmas
by: SHEN DEMIN
Published: (2010) -
A general Fatou Lemma
by: Loeb, P.A., et al.
Published: (2011) -
A composition theorem for randomized query complexity
by: Anshu, Anurag, et al.
Published: (2018)