%0 Conference Paper %1 conf/fct/FriedlISV05 %A Friedl, Katalin %A Ivanyos, Gábor %A Santha, Miklos %A Verhoeven, Yves F. %B FCT %D 2005 %E Liskiewicz, Maciej %E Reischuk, Rüdiger %I Springer %K dblp %P 245-257 %T On the Black-Box Complexity of Sperner's Lemma. %U http://dblp.uni-trier.de/db/conf/fct/fct2005.html#FriedlISV05 %V 3623 %@ 3-540-28193-2

@inproceedings{conf/fct/FriedlISV05, added-at = {2017-05-17T00:00:00.000+0200}, author = {Friedl, Katalin and Ivanyos, Gábor and Santha, Miklos and Verhoeven, Yves F.}, biburl = {https://www.bibsonomy.org/bibtex/2643da54c640a7735aab26d59ec74a038/dblp}, booktitle = {FCT}, crossref = {conf/fct/2005}, editor = {Liskiewicz, Maciej and Reischuk, Rüdiger}, ee = {https://doi.org/10.1007/11537311_22}, interhash = {61eff7bb0648c960f6dfb4c15ba5e4e7}, intrahash = {643da54c640a7735aab26d59ec74a038}, isbn = {3-540-28193-2}, keywords = {dblp}, pages = {245-257}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T20:30:19.000+0200}, title = {On the Black-Box Complexity of Sperner's Lemma.}, url = {http://dblp.uni-trier.de/db/conf/fct/fct2005.html#FriedlISV05}, volume = 3623, year = 2005 }