Sperner's lemma states that any admissible coloring of any triangulation of the unit triangle has a 3‐colored triangle. In this paper, we first show that any algorithm to find this 3‐colored triangle that treats the coloring itself as an oracle must be in the worst case linear in the size of the triangulation. Successively, we apply this lower bound to solve three open questions on robust machines posed by Hartmanis and Hemachandra.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Received: November 4, 1993
About this article
Cite this article
Crescenzi, P., Silvestri, R. Sperner's lemma and robust machines. Comput. complex. 7, 163–173 (1998). https://doi.org/10.1007/s000370050008
- Key words. Sperner's lemma; robust Turing machines.