Sperner lemma complete for PPA

Information Processing Letters

Volumn 77, Issue 5-6, 2001, Pages 255-259

  Grigni, Michelangelo ^a  

^a EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; GRAPH THEORY;

SPERNER LEMMA;

THEOREM PROVING;

EID: 0035276977     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00152-6     Document Type: Article

References (5)

1. Papadimitriou C. On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. System Sci. Vol. 48:(3):1994;498-532.
2. Johnson D.S., Papadimitriou C.H., Yannakakis M. How easy is local search? J. Comput. System Sci. Vol. 37:(1):1988;79-100.
3. Megiddo N., Papadimitriou C.H. On total functions, existence theorems and computational complexity. Theoret. Comput. Sci. Vol. 81:(2):1991;317-324.
4. Beame P., Cook S., Edmonds J., Impagliazzo R., Pitassi T. The relative complexity of NP search problems. J. Comput. System Sci. Vol. 57:(1):1998;3-19.
5. Rotman J.J. An Introduction to Algebraic Topology. Graduate Texts in Mathematics. Vol. 119:1988;Springer, Berlin.