{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T06:04:23Z","timestamp":1746079463505},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_36","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"380-391","source":"Crossref","is-referenced-by-count":4,"title":["Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes"],"prefix":"10.1007","author":[{"given":"Katalin","family":"Friedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Ivanyos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves F.","family":"Verhoeven","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1998.1575","volume":"57","author":"P. Beame","year":"1998","unstructured":"Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., Pitassi, T.: The relative complexity of NP search problems. J. Comput. System Sci.\u00a057(1), 3\u201319 (1998)","journal-title":"J. Comput. System Sci."},{"key":"36_CR2","unstructured":"Chen, X., Deng, X.: Settling the Complexity of 2-Player Nash-Equilibrium. ECCC Report\u00a0140 (2005)"},{"key":"36_CR3","unstructured":"Goddyn, L., Bruce Richter, R., \u0160ir\u00e1\u0148, J.: Triangular embeddings of complete graphs from graceful labellings of paths (preprint, 2004)"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/S0021-9800(67)80063-2","volume":"2","author":"K. Fan","year":"1967","unstructured":"Fan, K.: Simplicial maps from an orientable n-pseudomanifold into S m with the octahedral triangulation. J. Combinatorial Theory\u00a02, 588\u2013602 (1967)","journal-title":"J. Combinatorial Theory"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Friedl, K., Ivanyos, G., Santha, M., Verhoeven, Y.F.: On the complexity of Sperner\u2019s Lemma. Isaac Newton Institute Preprint Series NI05002 (2005)","DOI":"10.1007\/11537311_22"},{"issue":"5-6","key":"36_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0020-0190(00)00152-6","volume":"77","author":"M. Grigni","year":"2001","unstructured":"Grigni, M.: A Sperner lemma complete for PPA. Inform. Process. Lett.\u00a077(5-6), 255\u2013259 (2001)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"36_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D. Johnson","year":"1988","unstructured":"Johnson, D., Papadimitriou, C., Yannakakis, M.: How easy is local search? J. Comput. System Sci.\u00a037(1), 79\u2013100 (1988)","journal-title":"J. Comput. System Sci."},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1006\/jctb.2000.1993","volume":"81","author":"V.P. Korzhik","year":"2001","unstructured":"Korzhik, V.P., Voss, H.-J.: On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs. J.\u00a0Combinatorial Theory Series B\u00a081, 58\u201376 (2001)","journal-title":"J.\u00a0Combinatorial Theory Series B"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(91)90200-L","volume":"81","author":"N. Megiddo","year":"1991","unstructured":"Megiddo, N., Papadimitriou, C.: On total functions, existence theorems and computational complexity. Theoret. Comput. Sci.\u00a081, 317\u2013324 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR10","series-title":"Johns Hopkins Studies in the Mathematical Sciences","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on surfaces","author":"B. Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2001)"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: On graph-theoretic lemmata and complexity classes. In: Proc. of 31st FOCS, pp. 794\u2013801 (1990)","DOI":"10.1109\/FSCS.1990.89602"},{"issue":"3","key":"36_CR12","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. System Sci.\u00a048(3), 498\u2013532 (1994)","journal-title":"J. Comput. System Sci."},{"key":"36_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-65759-7","volume-title":"Map Color Theorem","author":"G. Ringel","year":"1974","unstructured":"Ringel, G.: Map Color Theorem. Springer, New York (1974)"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02940617","volume":"6","author":"E. Sperner","year":"1928","unstructured":"Sperner, E.: Neuer Beweis f\u00fcr die Invarianz der Dimensionzahl und des Gebietes. Abh. Math. Sem. Hamburg Univ.\u00a06, 265\u2013272 (1928)","journal-title":"Abh. Math. Sem. Hamburg Univ."},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0167-5060(08)70511-9","volume":"3","author":"A. Thomason","year":"1978","unstructured":"Thomason, A.: Hamilton cycles and uniquely edge colourable graphs. Ann. Discrete Math.\u00a03, 259\u2013268 (1978)","journal-title":"Ann. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T16:12:03Z","timestamp":1683475923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11758471_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}