NP-hardness

Known as: NP-Hard Problem, NP-hard, NP 
NP-hardness (non-deterministic polynomial-time hard), in computational complexity theory, is a class of problems that are, informally, "at least as… (More)
Wikipedia

Related topics

Related topics

31 relations
Approximate computingBoolean satisfiability problemCompilerComputational complexity theory
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Maintenance scheduling in the electricity industry: A literature review
The reliability of the power plants and transmission lines in the electricity industry is crucial for meeting demand… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Most Tensor Problems Are NP-Hard
We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our… (More)
  • table I
  • figure 1
  • table II
  • figure 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
NP-hardness of Euclidean sum-of-squares clustering
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
On the NP hardness of solving bilinear matrix inequalities and simultaneous stabilization with static output feedback
  • 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
On the hardness of approximating minimum vertex cover By
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)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Proof Verification and the Hardness of Approximation Problems
We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of… (More)
  • figure 1
  • table I
  • table II
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP
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
Robust Proofs of NP-Hardness for Protein Folding: General Lattices and Energy Potentials
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
NP-hardness of some linear control design problems
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
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
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?