Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

32 relations
Approximate computingBoolean satisfiability problemCompilerComputational complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… 
Highly Cited
2009
Highly Cited
2009
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… 
Highly Cited
2009
Highly Cited
2009
Cuckoo Search via Lévy flights
In this paper, we intend to formulate a new meta-heuristic algorithm, called Cuckoo Search (CS), for solving optimization… 
Highly Cited
2008
Highly Cited
2008
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… 
Highly Cited
2008
Highly Cited
2008
Strong NP-hardness of the quantum separability problem
Given the density matrix ρ of a bipartite quantum state, the quantum separability prob-lem asks whether ρ is entangled or… 
Review
2008
Review
2008
Data clustering: 50 years beyond K-means
  • Anil K. Jain
  • Pattern Recognition Letters
  • 2008
  • Corpus ID: 11152703
Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a… 
Highly Cited
2003
Highly Cited
2003
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains… 
Highly Cited
1997
Highly Cited
1997
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
  • R. RazS. Safra
  • Symposium on the Theory of Computing
  • 1997
  • Corpus ID: 15457604
We introduce a new low-degree-test, one that uses the restriction of low-degree polynomials to planes (i. e., afine sub-spaces of… 
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… 
Highly Cited
1980
Highly Cited
1980
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
Suppose that an independence system $(E,\mathcal {I})$ is characterized by a subroutine which indicates in unit time whether or… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)