Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,257,088 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
2012
Highly Cited
2012
An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems
M. K. Marichelvam
International Journal of Bio-Inspired Computation…
2012
Corpus ID: 2470907
Permutation flow shop scheduling problems with makespan minimisation are considered in this paper. Flow shop scheduling is one…
Expand
Highly Cited
2009
Highly Cited
2009
A multi-objective scatter search for a dynamic cell formation problem
M. A. Bajestani
,
M. Rabbani
,
Alireza Rahimi-Vahed
,
G. B. Khoshkhou
Computers & Operations Research
2009
Corpus ID: 41272225
Highly Cited
2009
Highly Cited
2009
Joint optimization of segmentation and appearance models
S. Vicente
,
V. Kolmogorov
,
C. Rother
IEEE International Conference on Computer Vision
2009
Corpus ID: 8317980
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable…
Expand
Highly Cited
2009
Highly Cited
2009
Dynamic Multiple Fault Diagnosis: Mathematical Formulations and Solution Techniques
Satnam Singh
,
Kihoon Choi
,
+6 authors
Liu Qiao
IEEE Transactions on Systems, Man, and…
2009
Corpus ID: 8074719
Imperfect test outcomes, due to factors such as unreliable sensors, electromagnetic interference, and environmental conditions…
Expand
Highly Cited
2008
Highly Cited
2008
Modeling node capture attacks in wireless sensor networks
Patrick Tague
,
R. Poovendran
46th Annual Allerton Conference on Communication…
2008
Corpus ID: 15586218
We formalize a model for node capture attacks in which an adversary collects information about the network via eavesdropping on…
Expand
Highly Cited
2003
Highly Cited
2003
The optimal portfolio problem with coherent risk measure constraints
S. Benati
European Journal of Operational Research
2003
Corpus ID: 14162908
Highly Cited
2002
Highly Cited
2002
Hybrid genetic algorithm for the economic lot-scheduling problem
I. Moon
,
E. Silver
,
S. Choi
2002
Corpus ID: 109652426
The economic lot-scheduling problem (ELSP) is an important production scheduling problem that has been intensively studied over…
Expand
Highly Cited
2000
Highly Cited
2000
Simultaneous shield insertion and net ordering for capacitive and inductive coupling minimization
Lei He
,
Kevin M. Lepak
ACM International Symposium on Physical Design
2000
Corpus ID: 772918
In this paper, we first show that existing net ordering formulations to minimize noise are no longer valid with presence of…
Expand
Highly Cited
1998
Highly Cited
1998
Routing with end to end QoS guarantees in broadband networks
A. Orda
Proceedings. IEEE INFOCOM '98, the Conference on…
1998
Corpus ID: 13971995
We consider routing schemes for connections with end to end delay requirements, and investigate several fundamental problems…
Expand
Highly Cited
1989
Highly Cited
1989
A parallel heuristic for quadratic assignment problems
C. Huntley
,
Donald E. Brown
Computers & Operations Research
1989
Corpus ID: 2693848
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