On the complexity of the sperner lemma

Authors:
Stefan Dantchev
Affiliations:
Department of Computer Science, Durham University, Science Labs, Durham, UK
Venue:
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Year:
2006

Citing 8
Cited 0

Exponential lower bounds for the pigeonhole principle

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the complexity of the parity argument and other inefficient proofs of existence

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Bounded arithmetic, propositional logic, and complexity theory

Bounded arithmetic, propositional logic, and complexity theory
The relative complexity of NP search problems

Journal of Computer and System Sciences
Sperner's lemma and robust machines

Computational Complexity
Relativized NP Search Problems and Propositional Proof Systems

CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
The complexity of the pigeonhole principle

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
On the black-box complexity of sperner's lemma

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a reduction from the Pigeon-Hole Principle to the classical Sperner Lemma. The reduction is used 1. to show that the Sperner Lemma does not have a short constant-depth Frege proof, and 2. to prove lower bounds on the Query Complexity of the Sperner Lemma in the Black-Box model of Computation.