Classifying the computational complexity of problems
L Stockmeyer - The journal of symbolic logic, 1987 - cambridge.org
One of the more significant achievements of twentieth century mathematics, especially from
the viewpoints of logic and computer science, was the work of Church, Gödel and Turing in …
the viewpoints of logic and computer science, was the work of Church, Gödel and Turing in …
[图书][B] On the structure of intractable sets (binary relation)
JG Geske - 1987 - search.proquest.com
There are two parts to this dissertation. The first part is motivated by nothing less than a
reexamination of what it means for a set to be NP-complete. Are there sets in NP that in a …
reexamination of what it means for a set to be NP-complete. Are there sets in NP that in a …
[图书][B] Some generalizations of heuristics for solution of the traveling salesman problem
JM Cargal - 1987 - search.proquest.com
Two different general approaches to optimizing traveling salesman problem (TSP) tours are
investigated. One is a tour construction approach, and the other is a tour improvement …
investigated. One is a tour construction approach, and the other is a tour improvement …