The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
On the black-box complexity of Sperner's Lemma
[article]
2005
arXiv
pre-print
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
arXiv:quant-ph/0505185v1
fatcat:h5tf3kizjvaf3nxp5jkmb4uby4