{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T09:55:53Z","timestamp":1787910953374,"version":"build-2784847793"},"reference-count":35,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6986,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1016\/s0022-0000(05)80063-7","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T07:18:35Z","timestamp":1124522315000},"page":"498-532","source":"Crossref","is-referenced-by-count":459,"title":["On the complexity of the parity argument and other inefficient proofs of existence"],"prefix":"10.1016","volume":"48","author":[{"given":"Christos H.","family":"Papadimitriou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80063-7_bib1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0095-8956(84)90047-9","article-title":"Regular subgraphs of almost regular graphs","volume":"37","author":"Alon","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0022-0000(05)80063-7_bib2","unstructured":"N. Alon, private communication, May 1990."},{"key":"10.1016\/S0022-0000(05)80063-7_bib3","series-title":"Proceedings","first-page":"586","article-title":"A parallel algorithmic version of the local lemma","author":"Alon","year":"1991"},{"issue":"No. 3","key":"10.1016\/S0022-0000(05)80063-7_bib4","doi-asserted-by":"crossref","DOI":"10.2307\/1907353","article-title":"Existence of an equilibrium for a competitive economy","volume":"27","author":"Arrow","year":"1954","journal-title":"Econometrica"},{"key":"10.1016\/S0022-0000(05)80063-7_bib5","series-title":"The relative complexity of NP search problems","author":"Beame","year":"1993"},{"key":"10.1016\/S0022-0000(05)80063-7_bib6","article-title":"[TIME, SPACE](T, S) \u2264 REVERSIBLE [TIME, SPACE](T1,585, S log T) for Multitape Turing Machines","author":"Bennet","year":"1984","journal-title":"IBM Yorktown Heights report"},{"key":"10.1016\/S0022-0000(05)80063-7_bib7_1","article-title":"Bounded Arithmetic","author":"Buss","year":"1986","journal-title":"Bibliopolis, Naples, Italy"},{"key":"10.1016\/S0022-0000(05)80063-7_bib7_2","year":"1985"},{"key":"10.1016\/S0022-0000(05)80063-7_bib8","unstructured":"S. A. Cook, private communication, February 1991."},{"key":"10.1016\/S0022-0000(05)80063-7_bib9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(68)90052-9","article-title":"Complementary pivot theory of mathematical programming","volume":"1","author":"Cottle","year":"1986","journal-title":"Linear Algebra Appl."},{"issue":"No. 4","key":"10.1016\/S0022-0000(05)80063-7_bib10","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1287\/moor.9.4.479","article-title":"Variable dimension complexes. Part I. Basic theory","volume":"9","author":"Freund","year":"1984","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0022-0000(05)80063-7_bib11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0097-3165(81)90027-3","article-title":"A constructive proof of Tucker's combinatorial lemma","volume":"30","author":"Freund","year":"1981","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0022-0000(05)80063-7_bib12_1","series-title":"Proceedings","first-page":"401","article-title":"Exponential lower bounds for finding Brouwer fixpoints","author":"Hirsch","year":"1987"},{"key":"10.1016\/S0022-0000(05)80063-7_bib12_2","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0885-064X(89)90017-4","article-title":"Exponential lower bounds for finding Brouwer fixpoints","volume":"5","author":"Hirsch","year":"1989","journal-title":"J. Complexity"},{"key":"10.1016\/S0022-0000(05)80063-7_bib13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01360282","article-title":"The Jacobian matrix and global univalence of mappings","volume":"159","author":"Gale","year":"1965","journal-title":"Math. Ann."},{"key":"10.1016\/S0022-0000(05)80063-7_bib14_1","series-title":"Proceedings, 26th Annual Symp. Foundations Comput. Sci.","first-page":"39","article-title":"How easy is local search?","author":"Johnson","year":"1985"},{"key":"10.1016\/S0022-0000(05)80063-7_bib14_2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80063-7_bib15","unstructured":"J. Kratochvil, private communication, July 1990."},{"key":"10.1016\/S0022-0000(05)80063-7_bib16","unstructured":"E. Koutsoupias, private communication, August 1990."},{"key":"10.1016\/S0022-0000(05)80063-7_bib17","series-title":"Proceedings, 30th Annual Symp. Foundations Comp. Sci.","first-page":"216","article-title":"Structure of locally optimal solutions","author":"Krentel","year":"1989"},{"key":"10.1016\/S0022-0000(05)80063-7_bib18","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","article-title":"Bimatrix equilibrium points and mathematical programming","volume":"11","author":"Lemke","year":"1965","journal-title":"Management Sci."},{"key":"10.1016\/S0022-0000(05)80063-7_bib19","first-page":"413","article-title":"Equilibrium points in bimatrix games","volume":"12","author":"Lemke","year":"1964","journal-title":"J. SIAM"},{"key":"10.1016\/S0022-0000(05)80063-7_bib20","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1981"},{"key":"10.1016\/S0022-0000(05)80063-7_bib21","article-title":"A Note on Total Functions, Existence Theorems, and Computational Complexity","author":"Megiddo","year":"1989","journal-title":"IBM Research Report RJ 7091"},{"key":"10.1016\/S0022-0000(05)80063-7_bib22","article-title":"The adjacency relation on the travelling salesman polytope is NP-complete","author":"Papadimitriou","year":"1977","journal-title":"Math. Programming"},{"key":"10.1016\/S0022-0000(05)80063-7_bib23","series-title":"Proceedings","article-title":"On graph-theoretic lemmata and complexity classes","author":"Papadimitriou","year":"1990"},{"key":"10.1016\/S0022-0000(05)80063-7_bib24","series-title":"Proceedings","article-title":"On the complexity of local search","author":"Papadimitriou","year":"1990"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80063-7_bib25","first-page":"337","article-title":"Extensions of k-subsets to (k + 1)-subsets: Existence versus constructability","volume":"23","author":"Poljak","year":"1982","journal-title":"Comment. Math. Univ. Carolin."},{"key":"10.1016\/S0022-0000(05)80063-7_bib26","article-title":"Every prime has a succinct certificate","volume":"5","author":"Pratt","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80063-7_bib27","series-title":"Applied General Equilibrium Analysis","year":"1984"},{"key":"10.1016\/S0022-0000(05)80063-7_bib28","series-title":"Proceedings","article-title":"On relativization and the existence of complete sets","author":"Sipser","year":"1982"},{"key":"10.1016\/S0022-0000(05)80063-7_bib29","series-title":"SIAM, CBMS-NSF Regional Conference Series, No. 52","article-title":"Then Lectures on the Probabilistic Method","author":"Spencer","year":"1987"},{"key":"10.1016\/S0022-0000(05)80063-7_bib30","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0167-5060(08)70511-9","article-title":"Hamilton cycles and uniquely edge colourable graphs","volume":"3","author":"Thomason","year":"1978","journal-title":"Ann. Discrete Math."},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80063-7_bib31","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1287\/moor.1.1.54","article-title":"Orientation in complementary pivot algorithms","volume":"1","author":"Todd","year":"1976","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0022-0000(05)80063-7_bib32","first-page":"59","article-title":"Walras's existence theorem and Brouwer's fixpoint theorem","volume":"13","author":"Uzawa","year":"1962","journal-title":"Econ. Stud. Quart."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800637?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800637?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T12:41:23Z","timestamp":1552826483000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["S0022000005800637"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80063-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}