On the Complexity of Local Search (Extended Abstract)

  title={On the Complexity of Local Search (Extended Abstract)},
  author={Christos H. Papadimitriou and Alejandro A. Sch{\"a}ffer and Mihalis Yannakakis},
We prove a number of complexity results on the computational paradigm of local op-timality. Our main results are these: (a) Finding a local optimum under the Lin-Kernighan heuristic for the traveling salesman problemis PLS-complete. (b) Finding stable configurations in neural networks in the Hopfield mode/is PLS-complete. (c) We show that a host of simple… CONTINUE READING