Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

We address the question of whether it may be worthwhile to convert certain, now classical, NP-complete problems to one of a… Expand

Highly Cited

2014

Highly Cited

2014

We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This… Expand

Highly Cited

2001

Highly Cited

2001

Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words… Expand

Highly Cited

1994

Highly Cited

1994

Genetic algorithms (GAs) are biologically motivated adaptive systems which have been used, with varying degrees of success, for… Expand

Highly Cited

1991

Highly Cited

1991

It is well known that for many NP-complete problems, such as K-Sat, etc., typical cases are easy to solve; so that… Expand

Highly Cited

1987

Highly Cited

1987

AbstractIn continuous variable, smooth, nonconvex nonlinear programming, we analyze the complexity of checking whether(a)a given… Expand

Highly Cited

1981

Highly Cited

1981

We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for… Expand

Highly Cited

1978

Highly Cited

1978

The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand

Highly Cited

1976

Highly Cited

1976

Abstract It is widely believed that showing a problem to be NP -complete is tantamount to proving its computational… Expand

Highly Cited

1955

Highly Cited

1955

Theory of Functions of Real VariablesBy Prof. Henry P. Thielman. (Prentice-Hall Mathematics Series.) Pp. xiii + 209. (London… Expand