A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the Black-Box Complexity of Sperner's Lemma
2008
Theory of Computing Systems
We present several results on the complexity of various forms of Sperner's Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over pseudo-manifolds of arbitrary dimension. The query complexity of our algorithm is linear in the separation number of the skeleton graph of the manifold and the size of its boundary. As a corollary we get an O( √ n) deterministic query algorithm for the black-box version of the problem 2D-SPERNER, a well studied member
doi:10.1007/s00224-008-9121-2
fatcat:3ioyremd2bb5bnl4jp7h4wt6ge