MathSciNet bibliographic data

MR2194850 (2006h:68065) 68Q25 (05C85 68Q15 81P68) Friedl, Katalin; Ivanyos, Gábor; Santha, Miklos; Verhoeven, Yves F. On the black-box complexity of Sperner's lemma. Fundamentals of computation theory, 245--257, Lecture Notes in Comput. Sci., 3623, Springer, Berlin, 2005.

Links to the journal or article are not yet available

For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page American Mathematical Society 201 Charles Street Providence, RI 02904-6248 USA © Copyright 2010, American Mathematical Society Privacy Statement