Sperner's lemma and robust machines
From MaRDI portal
Publication:1272662
DOI10.1007/s000370050008zbMath1034.68519OpenAlexW3162010657WikidataQ124850180 ScholiaQ124850180MaRDI QIDQ1272662
Riccardo Silvestri, Pierluigi Crescenzi
Publication date: 9 May 1999
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s000370050008
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
On the complexity of finding a local maximum of functions on discrete planar subsets ⋮ On the black-box complexity of Sperner's Lemma ⋮ Inverting onto functions. ⋮ Fault-tolerance and complexity (Extended abstract) ⋮ A simplicial approach for discrete fixed point theorems ⋮ On the query complexity of finding a local maximum point. ⋮ On characterizing the existence of partial one-way permutations
This page was built for publication: Sperner's lemma and robust machines
