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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Permutation flow shop scheduling problems with makespan minimisation are considered in this paper. Flow shop scheduling is one… 
Highly Cited
2009
Highly Cited
2009
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable… 
Highly Cited
2009
Highly Cited
2009
Imperfect test outcomes, due to factors such as unreliable sensors, electromagnetic interference, and environmental conditions… 
Highly Cited
2008
Highly Cited
2008
We formalize a model for node capture attacks in which an adversary collects information about the network via eavesdropping on… 
Highly Cited
2002
Highly Cited
2002
The economic lot-scheduling problem (ELSP) is an important production scheduling problem that has been intensively studied over… 
Highly Cited
2000
Highly Cited
2000
In this paper, we first show that existing net ordering formulations to minimize noise are no longer valid with presence of… 
Highly Cited
1998
Highly Cited
1998
  • A. Orda
  • 1998
  • Corpus ID: 13971995
We consider routing schemes for connections with end to end delay requirements, and investigate several fundamental problems…