For 10  points—name this algorithmic property, examples of which include the Hamiltonian cycle, vertex cover, and traveling salesman problems.
In 1971, Steven Cook called circuit satisfiability the "original" problem with this property. Proven by reduction, if any [*] one problem of this type can be solved in polynomial time, then all of them can. For 10  points—name this algorithmic property, examples of which include the Hamiltonian cycle, vertex cover, and traveling salesman problems.
In 1971, Steven Cook called circuit satisfiability the "original" problem with this property.
NP-completeness or NP-complete problems