Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,197,296 papers from all fields of science
Search
Sign In
Create Free Account
NP-hardness
Known as:
NP-Hard Problem
, NP-hard
, NP
Expand
NP-hardness (non-deterministic polynomial-time hard), in computational complexity theory, is a class of problems that are, informally, "at least as…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
32 relations
Approximate computing
Boolean satisfiability problem
Compiler
Computational complexity theory
Expand
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
Mark A. Miller
,
W. Pfeiffer
,
Terri Schwartz
Grid Computing Environments
2010
Corpus ID: 11513586
Understanding the evolutionary history of living organisms is a central problem in biology. Until recently the ability to infer…
Expand
Highly Cited
2009
Highly Cited
2009
Most Tensor Problems Are NP-Hard
C. Hillar
,
Lek-Heng Lim
JACM
2009
Corpus ID: 1460452
We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our…
Expand
Highly Cited
2009
Highly Cited
2009
Cuckoo Search via Lévy flights
Xin-She Yang
,
S. Deb
World Congress on Nature and Biologically…
2009
Corpus ID: 206491725
In this paper, we intend to formulate a new meta-heuristic algorithm, called Cuckoo Search (CS), for solving optimization…
Expand
Highly Cited
2008
Highly Cited
2008
NP-hardness of Euclidean sum-of-squares clustering
Daniel Aloise
,
A. Deshpande
,
P. Hansen
,
P. Popat
Machine-mediated learning
2008
Corpus ID: 3676466
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
2008
Highly Cited
2008
Strong NP-hardness of the quantum separability problem
Sevag Gharibian
Quantum information & computation
2008
Corpus ID: 621887
Given the density matrix ρ of a bipartite quantum state, the quantum separability prob-lem asks whether ρ is entangled or…
Expand
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…
Expand
Highly Cited
2003
Highly Cited
2003
Maximizing the spread of influence through a social network
D. Kempe
,
J. Kleinberg
,
É. Tardos
Knowledge Discovery and Data Mining
2003
Corpus ID: 7214363
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains…
Expand
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. Raz
,
S. 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…
Expand
Highly Cited
1995
Highly Cited
1995
NP-hardness of some linear control design problems
V. Blondel
,
J. Tsitsiklis
Proceedings of 34th IEEE Conference on Decision…
1995
Corpus ID: 1913351
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
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
E. Lawler
,
J. Lenstra
,
A. Kan
SIAM journal on computing (Print)
1980
Corpus ID: 29527771
Suppose that an independence system $(E,\mathcal {I})$ is characterized by a subroutine which indicates in unit time whether or…
Expand
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)
ACCEPT & CONTINUE