Locally 2-dimensional sperner problems complete for the polynomial parity argument classes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3998 LNCS, Issue , 2006, Pages 380-391

  Friedl, Katalin ^a   Ivanyos, Gábor ^b   Santha, Miklos ^c   Verhoeven, Yves F ^c,d  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^b INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

^c CNRS   (France)

^d TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; LARGE SCALE SYSTEMS; POLYNOMIAL APPROXIMATION;

2-DIMENSIONAL SPERNER PROBLEMS; BIOINFORMATIC; POLYNOMIAL PARITY ARGUMENT; PPAD;

PROBLEM SOLVING;

EID: 33746052041     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758471_36     Document Type: Conference Paper

References (15)

1. P. Beame, S. Cook, J. Edmonds, R. Impagliazzo and T. Pitassi. The relative complexity of NP search problems. J. Comput. System Sci., 57(1):3-19, 1998.
2. X. Chen and X. Deng. Settling the Complexity of 2-Player Nash-Equilibrium. ECCC Report 140, 2005.
3. L. Goddyn, R. Bruce Richter and Jozef Širáň. Triangular embeddings of complete graphs from graceful labellings of paths. Preprint, 2004.
4. K. Fan. Simplicial maps from an orientable n-pseudomanifold into S m with the octahedral triangulation. J. Combinatorial Theory, 2:588-602, 1967.
5. K. Friedl, G. Ivanyos, M. Santha and Y. F. Verhoeven. On the complexity of Sperner's Lemma. Isaac Newton Institute Preprint Series NI05002, 2005.
6. M. Grigni. A Sperner lemma complete for PPA. Inform. Process. Lett., 77(5-6):255-259, 2001.
7. D. Johnson, C. Papadimitriou and M. Yannakakis. How easy is local search? J. Comput. System Sci., 37(1):79-100, 1988.
8. V. P. Korzhik and H.-J. Voss, On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs, J. Combinatorial Theory Series B 81:58-76 (2001).
9. N. Megiddo and C. Papadimitriou. On total functions, existence theorems and computational complexity. Theoret. Comput. Sci., 81:317-324, 1991.
10. B. Mohar and C. Thomassen. Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD, 2001.
11. C. Papadimitriou. On graph-theoretic lemmata and complexity classes. In Proc. of 31st FOCS, pp. 794-801, 1990.
12. C. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. System Sci., 48(3):498-532, 1994.
13. G. Ringel, Map Color Theorem, Springer-Verlag, New York, 1974.
14. E. Sperner. Neuer Beweis für die Invarianz der Dimensionzahl und des Gebietes. Abh. Math. Sem. Hamburg Univ. 6:265-272, 1928.
15. A. Thomason. Hamilton cycles and uniquely edge colourable graphs. Ann. Discrete Math. 3: 259-268, 1978.