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
2012
Highly Cited
2012
An improved hybrid Cuckoo Search (IHCS) metaheuristics algorithm for permutation flow shop scheduling problems
Permutation flow shop scheduling problems with makespan minimisation are considered in this paper. Flow shop scheduling is one… 
Highly Cited
2009
Highly Cited
2009
A multi-objective scatter search for a dynamic cell formation problem
Highly Cited
2009
Highly Cited
2009
Joint optimization of segmentation and appearance models
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable… 
Highly Cited
2009
Highly Cited
2009
Dynamic Multiple Fault Diagnosis: Mathematical Formulations and Solution Techniques
Imperfect test outcomes, due to factors such as unreliable sensors, electromagnetic interference, and environmental conditions… 
Highly Cited
2008
Highly Cited
2008
Modeling node capture attacks in wireless sensor networks
We formalize a model for node capture attacks in which an adversary collects information about the network via eavesdropping on… 
Highly Cited
2003
Highly Cited
2003
The optimal portfolio problem with coherent risk measure constraints
Highly Cited
2002
Highly Cited
2002
Hybrid genetic algorithm for the economic lot-scheduling problem
The economic lot-scheduling problem (ELSP) is an important production scheduling problem that has been intensively studied over… 
Highly Cited
2000
Highly Cited
2000
Simultaneous shield insertion and net ordering for capacitive and inductive coupling minimization
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
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… 
Highly Cited
1989
Highly Cited
1989
A parallel heuristic for quadratic assignment problems
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)