Skip to main content
Springer Nature Link
Log in

Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes

  • Conference paper
Algorithms and Complexity (CIAC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3998))

Included in the following conference series:

  • 619 Accesses

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

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chen, X., Deng, X.: Settling the Complexity of 2-Player Nash-Equilibrium. ECCC Report 140 (2005)

    Google Scholar 

  3. Goddyn, L., Bruce Richter, R., Širáň, J.: Triangular embeddings of complete graphs from graceful labellings of paths (preprint, 2004)

    Google Scholar 

  4. Fan, K.: Simplicial maps from an orientable n-pseudomanifold into S m with the octahedral triangulation. J. Combinatorial Theory 2, 588–602 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  5. Friedl, K., Ivanyos, G., Santha, M., Verhoeven, Y.F.: On the complexity of Sperner’s Lemma. Isaac Newton Institute Preprint Series NI05002 (2005)

    Google Scholar 

  6. Grigni, M.: A Sperner lemma complete for PPA. Inform. Process. Lett. 77(5-6), 255–259 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Johnson, D., Papadimitriou, C., Yannakakis, M.: How easy is local search? J. Comput. System Sci. 37(1), 79–100 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  8. 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)

    Article  MATH  MathSciNet  Google Scholar 

  9. Megiddo, N., Papadimitriou, C.: On total functions, existence theorems and computational complexity. Theoret. Comput. Sci. 81, 317–324 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  10. Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2001)

    MATH  Google Scholar 

  11. Papadimitriou, C.: On graph-theoretic lemmata and complexity classes. In: Proc. of 31st FOCS, pp. 794–801 (1990)

    Google Scholar 

  12. Papadimitriou, C.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. System Sci. 48(3), 498–532 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ringel, G.: Map Color Theorem. Springer, New York (1974)

    MATH  Google Scholar 

  14. Sperner, E.: Neuer Beweis für die Invarianz der Dimensionzahl und des Gebietes. Abh. Math. Sem. Hamburg Univ. 6, 265–272 (1928)

    Article  MATH  Google Scholar 

  15. Thomason, A.: Hamilton cycles and uniquely edge colourable graphs. Ann. Discrete Math. 3, 259–268 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BME, H-1521, Budapest, P.O.Box 91, Hungary

    Katalin Friedl

  2. MTA SZTAKI, H-1518, Budapest, P.O. Box 63, Hungary

    Gábor Ivanyos

  3. CNRS–LRI, Université Paris XI, UMR 8623, bâtiment 490, 91405, Orsay, France

    Miklos Santha & Yves F. Verhoeven

  4. ENST, 46 rue Barrault, 75013, Paris, France

    Yves F. Verhoeven

Authors
  1. Katalin Friedl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gábor Ivanyos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Miklos Santha
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yves F. Verhoeven
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Rome, ”Sapienza”, Italy

    Tiziana Calamoneri

  2. Computer Science Department, Sapienza University of Rome, Via Salaria, 113, 00198, Rome, Italy

    Irene Finocchi

  3. Dipartimento di Informatica, Sistemi e Produzione, Università di Roma “Tor Vergata”, via del Politecnico 1, 00133, Roma, Italy

    Giuseppe F. Italiano

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics