On the black-box complexity of Sperner's Lemma

Friedl, Katalin and Ivanyos, Gábor and Santha, Miklos and Verhoeven, Yves F. (2009) On the black-box complexity of Sperner's Lemma. Theory of Computing Systems, 45. pp. 629-646.

[img] Text
10.10072Fs0022400891212.pdf - Published Version
Restricted to Registered users only

Download (465kB)
Item Type: ISI 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:31
Last Modified: 11 Dec 2012 15:31
URI: http://eprints.sztaki.hu/id/eprint/5298

Update Item Update Item