On Inefficient Proofs of Existence and Complexity Classes

[1]  Zsolt Tuza,et al.  One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete , 1993, SIAM J. Comput..

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

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

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

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

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

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