4 search results - page 1 / 1 » On the Black-Box Complexity of Sperner's Lemma |
FCT
2005
Springer
13 years 10 months ago
2005
Springer
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 ...
CIE
2006
Springer
13 years 8 months ago
2006
Springer
ENDM
2008
13 years 4 months ago
2008
The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It...
ALGORITHMICA
2010
13 years 4 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...