On the black-box complexity of Sperner's Lemma

• Main Authors: Friedl, K., Ivanyos, G., Santha, M., Verhoeven, Y.F.
• 其他作者: CENTRE FOR QUANTUM TECHNOLOGIES
• 格式: Article
• 出版: 2014
• 主題: Deterministic algorithm; Probabilistic and quantum lower bound; Query complexity; Sperner's lemma
• 在線閱讀: http://scholarbank.nus.edu.sg/handle/10635/112475

10.1007/s00224-008-9121-2