Karp's 21 NP-complete problems
Semantic Scholar uses AI to extract papers important to this topic.
We address the question of whether it may be worthwhile to convert certain, now classical, NP-complete problems to one of a… Expand We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This… Expand Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words… Expand Genetic algorithms (GAs) are biologically motivated adaptive systems which have been used, with varying degrees of success, for… Expand It is well known that for many NP-complete problems, such as K-Sat, etc., typical cases are easy to solve; so that… Expand AbstractIn continuous variable, smooth, nonconvex nonlinear programming, we analyze the complexity of checking whether(a)a given… Expand We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for… Expand The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand Abstract It is widely believed that showing a problem to be NP -complete is tantamount to proving its computational… Expand Theory of Functions of Real VariablesBy Prof. Henry P. Thielman. (Prentice-Hall Mathematics Series.) Pp. xiii + 209. (London… Expand