On the Black-Box Complexity of Sperner s Lemma

Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven. On the Black-Box Complexity of Sperner s Lemma. In Maciej Liskiewicz, Rüdiger Reischuk, editors, Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings. Volume 3623 of Lecture Notes in Computer Science, pages 245-257, Springer, 2005. [doi]

Abstract

Abstract is missing.