Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
NP-hardness
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our… Expand
Highly Cited
2010
Highly Cited
2010
Understanding the evolutionary history of living organisms is a central problem in biology. Until recently the ability to infer… Expand
Highly Cited
2010
Highly Cited
2010
Given the density matrix ρ of a bipartite quantum state, the quantum separability prob-lem asks whether ρ is entangled or… Expand
Highly Cited
2009
Highly Cited
2009
A recent proof of NP-hardness of Euclidean sum-of-squares clustering, due to Drineas et al. (Mach. Learn. 56:9–33, 2004), is not… Expand
Highly Cited
2009
Highly Cited
2009
In this paper, we intend to formulate a new meta-heuristic algorithm, called Cuckoo Search (CS), for solving optimization… Expand
Highly Cited
2001
Highly Cited
2001
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. A common constraint is that the… Expand
Highly Cited
1998
Highly Cited
1998
We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of… Expand
Highly Cited
1997
Highly Cited
1997
We introduce a new low-degree-test, one that uses the restriction of low-degree polynomials to planes (i. e., afine sub-spaces of… Expand
Highly Cited
1995
Highly Cited
1995
We show that some basic linear control design problems are NP-hard, implying that, unless P=NP, they cannot be solved by… Expand
Highly Cited
1980
Highly Cited
1980
Suppose that an independence system $(E,\mathcal {I})$ is characterized by a subroutine which indicates in unit time whether or… Expand