Abstract
In this paper, we define three Sperner problems on specific surfaces and prove that they are complete respectively for the classes PPAD, PPADS and PPA. This is the first time that locally 2-dimensional Sperner problems are proved to be complete for any of the polynomial parity argument classes.
Research supported by the EU 5th framework programs RESQ IST-2001-37559, Centre of Excellence ICAI-CT-2000-70025, the EU 6th framework program QAP, the OTKA grants T42559, T46234, and by the ACI CR 2002-40, ACI SI 2003-24, ANR Blanc AlgoQP grants of the French Research Ministry.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., Pitassi, T.: The relative complexity of NP search problems. J. Comput. System Sci. 57(1), 3–19 (1998)
Chen, X., Deng, X.: Settling the Complexity of 2-Player Nash-Equilibrium. ECCC Report 140 (2005)
Goddyn, L., Bruce Richter, R., Širáň, J.: Triangular embeddings of complete graphs from graceful labellings of paths (preprint, 2004)
Fan, K.: Simplicial maps from an orientable n-pseudomanifold into S m with the octahedral triangulation. J. Combinatorial Theory 2, 588–602 (1967)
Friedl, K., Ivanyos, G., Santha, M., Verhoeven, Y.F.: On the complexity of Sperner’s Lemma. Isaac Newton Institute Preprint Series NI05002 (2005)
Grigni, M.: A Sperner lemma complete for PPA. Inform. Process. Lett. 77(5-6), 255–259 (2001)
Johnson, D., Papadimitriou, C., Yannakakis, M.: How easy is local search? J. Comput. System Sci. 37(1), 79–100 (1988)
Korzhik, V.P., Voss, H.-J.: On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs. J. Combinatorial Theory Series B 81, 58–76 (2001)
Megiddo, N., Papadimitriou, C.: On total functions, existence theorems and computational complexity. Theoret. Comput. Sci. 81, 317–324 (1991)
Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2001)
Papadimitriou, C.: On graph-theoretic lemmata and complexity classes. In: Proc. of 31st FOCS, pp. 794–801 (1990)
Papadimitriou, C.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. System Sci. 48(3), 498–532 (1994)
Ringel, G.: Map Color Theorem. Springer, New York (1974)
Sperner, E.: Neuer Beweis für die Invarianz der Dimensionzahl und des Gebietes. Abh. Math. Sem. Hamburg Univ. 6, 265–272 (1928)
Thomason, A.: Hamilton cycles and uniquely edge colourable graphs. Ann. Discrete Math. 3, 259–268 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Friedl, K., Ivanyos, G., Santha, M., Verhoeven, Y.F. (2006). Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds) Algorithms and Complexity. CIAC 2006. Lecture Notes in Computer Science, vol 3998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758471_36
Download citation
DOI: https://doi.org/10.1007/11758471_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34375-2
Online ISBN: 978-3-540-34378-3
eBook Packages: Computer ScienceComputer Science (R0)