Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,934,726 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.
2015
2015
Adversarial Prediction Games for Multivariate Losses
Hong Wang
,
Wei W. Xing
,
Kaiser Asif
,
Brian D. Ziebart
Neural Information Processing Systems
2015
Corpus ID: 19010748
Multivariate loss functions are used to assess performance in many modern prediction tasks, including information retrieval and…
Expand
2010
2010
Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA
C. Cicconetti
,
L. Lenzini
,
Andrea Lodi
,
S. Martello
,
E. Mingozzi
,
M. Monaci
IEEE/ACM Transactions on Networking
2010
Corpus ID: 1097305
In IEEE 802.16, the wireless resources are logically partitioned into 5-ms frames, which extend in two dimensions: time and…
Expand
2009
2009
Location-Routing models and methods for Freight Distribution and Infomobility in City Logistics
C. Sterle
2009
Corpus ID: 4947615
In this thesis two City Logistics problems have been tackled. The first is a design problem for a two-echelon freight…
Expand
Highly Cited
2007
Highly Cited
2007
A New Local Search Algorithm for the DNA Fragment Assembly Problem
E. Alba
,
Gabriel Luque
EvoCOP
2007
Corpus ID: 30638729
In this paper we propose and study the behavior of a new heuristic algorithm for the DNA fragment assembly problem: PALS. The DNA…
Expand
2007
2007
The partitioned dynamic-priority scheduling of sporadic task systems
Sanjoy Baruah
,
N. Fisher
Real-time systems
2007
Corpus ID: 7995237
Abstract A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an…
Expand
2007
2007
Soft Real-Time Fuzzy Task Scheduling for Multiprocessor Systems
Mahdi Hamzeh
,
S. M. Fakhraie
,
C. Lucas
2007
Corpus ID: 9645420
All practical real-time scheduling algorithms in multiprocessor systems present a trade-off between their computational…
Expand
2007
2007
Generating Cyclic Fair Sequences using Aggregation and Stride Scheduling
J. Herrmann
2007
Corpus ID: 60729360
ISR develops, applies and teaches advanced methodologies of design and analysis to solve complex, hierarchical, heterogeneous and…
Expand
2005
2005
Petri net-based workflow modelling and analysis of the integrated manufacturing business processes
M. Dong
,
F. F. Chen
2005
Corpus ID: 61148379
The well-behaved properties in workflow systems are very important for business processes. In this paper, a structured business…
Expand
Highly Cited
2003
Highly Cited
2003
OFFSS: optimal fuzzy-valued feature subset selection
E. Tsang
,
D. Yeung
,
Xi-Zhao Wang
IEEE transactions on fuzzy systems
2003
Corpus ID: 12742436
Feature subset selection is a well-known pattern recognition problem, which aims to reduce the number of features used in…
Expand
1991
1991
Optimal channel pin assignment
Yang Cai
,
M. Wong
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1991
Corpus ID: 35513497
The authors study the channel pin assignment (CPA) problem subject to position constraints, order constraints, and separation…
Expand