On the black-box complexity of Sperner's Lemma

Friedl, K. and Ivanyos, Gábor and Santha, M. and Verhoeven, YF (2005) On the black-box complexity of Sperner's Lemma. LECTURE NOTES IN COMPUTER SCIENCE, 3623. pp. 234-246.

Full text not available from this repository.
Item Type: Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 15:18
Last Modified: 11 Dec 2012 15:18
URI: https://eprints.sztaki.hu/id/eprint/4020

Update Item Update Item