On the Complexity of Incremental Computation

[1]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[3]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[4]  Jan Krajícek,et al.  Interactive Computations of Optimal Solutions , 1990, MFCS.

[5]  A. Blum.  ALGORITHMS FOR APPROXIMATE GRAPH COLORING , 1991 .

[6]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[7]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[8]  Desh Ranjan,et al.  Quantifiers and approximation , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.