On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence

[1]  H. Kuk.  On equilibrium points in bimatrix games , 1996 .

[2]  外史 竹内.  Bounded Arithmetic と計算量の根本問題 , 1996 .

[3]  Russell Impagliazzo,et al.  The relative complexity of NP search problems , 1995, STOC '95.

[4]  Noga Alon.  A parallel algorithmic version of the local lemma , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[5]  Christos H. Papadimitriou,et al.  On Total Functions, Existence Theorems and Computational Complexity , 1991, Theor. Comput. Sci..

[6]  Christos H. Papadimitriou,et al.  On graph-theoretic lemmata and complexity classes , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[7]  Mihalis Yannakakis,et al.  On the complexity of local search , 1990, STOC '90.

[8]  Mark W. Krentel,et al.  Structure in locally optimal solutions , 1989, 30th Annual Symposium on Foundations of Computer Science.

[9]  Christos H. Papadimitriou,et al.  Exponential lower bounds for finding Brouwer fixed points , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[10]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[11]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[12]  Robert M. Freund,et al.  Variable Dimension Complexes Part I: Basic Theory , 2015, Math. Oper. Res..

[13]  Noga Alon,et al.  Regular subgraphs of almost regular graphs , 1984, J. Comb. Theory, Ser. B.

[14]  H. Scarf,et al.  Applied General Equilibrium Analysis , 1984 .

[15]  Michael Sipser,et al.  On Relativization and the Existence of Complete Sets , 1982, International Colloquium on Automata, Languages and Programming.

[16]  Michael J. Todd,et al.  A Constructive Proof of Tucker's Combinatorial Lemma , 1981, J. Comb. Theory, Ser. A.

[17]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[18]  Christos H. Papadimitriou,et al.  The adjacency relation on the traveling salesman polytope is NP-Complete , 1978, Math. Program..

[19]  A. Thomason.  Hamiltonian Cycles and Uniquely Edge Colourable Graphs , 1978 .

[20]  Michael J. Todd.  Orientation in Complementary Pivot Algorithms , 1976, Math. Oper. Res..

[21]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[22]  G. Dantzig,et al.  COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .

[23]  C. E. Lemke,et al.  Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[24]  D. Gale,et al.  The Jacobian matrix and global univalence of mappings , 1965 .

[25]  C. E. Lemke,et al.  Equilibrium Points of Bimatrix Games , 1964 .

[26]  H. Uzawa.  WALRAS' EXISTENCE THEOREM AND BROUWER'S FIXED-POINT THEOREM , 1962 .

[27]  K. Arrow,et al.  EXISTENCE OF AN EQUILIBRIUM FOR A COMPETITIVE ECONOMY , 1954 .