# NP-hardness

## Papers overview

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

Review

2016

Review

2016

- European Journal of Operational Research
- 2016

The reliability of the power plants and transmission lines in the electricity industry is crucial for meeting demandâ€¦Â (More)

Is this relevant?

Highly Cited

2013

Highly Cited

2013

- J. ACM
- 2013

We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Ourâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Machine Learning
- 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â€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- 2004

In this paper, it is shown that the problem of checking the solvability of a bilinear matrix inequality (BMI), is NP-hard. Aâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- 2004

We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCPâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- J. ACM
- 1998

We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number ofâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- STOC
- 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â€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Journal of Computational Biology
- 1997

This paper addresses the robustness of intractability arguments for simplified models of protein folding that use lattices toâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- 1995

We show that some basic linear control design problems are NP-hard, implying that, unless P=NP, they cannot be solved byâ€¦Â (More)

Is this relevant?

Highly Cited

1980

Highly Cited

1980

- SIAM J. Comput.
- 1980

Suppose that an independence system (E, ) is characterized by a subroutine which indicates in unit time whether or not a givenâ€¦Â (More)

Is this relevant?