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]](https://eprints.sztaki.hu/style/images/fileicons/text.png) |
Text
10.10072Fs0022400891212.pdf - Published Version Restricted to Registered users only Download (465kB) |
Official URL: http://dx.doi.org/10.1007/s00224-008-9121-2
| 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: | Artificial Intelligence Laboratory |
| Depositing User: | Eszter Nagy |
| Date Deposited: | 11 Dec 2012 15:31 |
| Last Modified: | 11 Dec 2012 15:31 |
| URI: | https://eprints.sztaki.hu/id/eprint/5298 |
 |
Update Item |
