Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

32 relations
Approximate computingBoolean satisfiability problemCompilerComputational complexity theory
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Machine Learning in the Air
Thanks to the recent advances in processing speed, data acquisition and storage, machine learning (ML) is penetrating every facet… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2018
Review
2018
Swarm Intelligence Algorithms for Feature Selection: A Review
The increasingly rapid creation, sharing and exchange of information nowadays put researchers and data scientists ahead of a… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
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… Expand
  • table I
  • figure 1
  • table II
  • figure 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Creating the CIPRES Science Gateway for inference of large phylogenetic trees
Understanding the evolutionary history of living organisms is a central problem in biology. Until recently the ability to infer… Expand
  • figure 1
  • figure 2
  • table 1
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… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
On the hardness of approximating minimum vertex cover
We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP… Expand
  • 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… Expand
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… Expand
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… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Strong NP-Hardness of Moving Many Discs
Le probleme de calcul du mouvement de gestion pour un systeme robotise simple a ete etudie plus recemment a partir d'un point de… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE