Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,004,155 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.
2016
2016
Calculating Accurate End-to-End Delay Bounds - You Better Know Your Cross-Traffic
Steffen Bondorf
,
J. Schmitt
EAI Endorsed Transactions on Ubiquitous…
2016
Corpus ID: 3806287
Bounds on the end-to-end delay of data flows play a crucial role in different areas, ranging from certification of hard real-time…
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
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
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
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
2005
2005
Scheduling on sensor hybrid network
Hongsik Choi
,
Ju Wang
,
E. Hughes
Proceedings. 14th International Conference on…
2005
Corpus ID: 6466740
We investigate a unique scheduling problem in wireless sensor networks where all nodes in a cluster send exactly one packet to a…
Expand
Highly Cited
2003
Highly Cited
2003
OFFSS: optimal fuzzy-valued feature subset selection
Eric C. C. Tsang
,
D. Yeung
,
Xizhao 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
1999
1999
Discrete dual QoS loading algorithms for multicarrier systems
L. Hoo
,
J. Tellado
,
J. Cioffi
IEEE International Conference on Communications
1999
Corpus ID: 61539307
We derive the optimal bit and energy allocation for a discrete multitone (DMT) modulation system simultaneously providing two…
Expand
1996
1996
Interval P-Matrices
J. Rohn
,
G. Rex
SIAM Journal on Matrix Analysis and Applications
1996
Corpus ID: 38654465
A characterization of interval P-matrices is given. The result implies that a symmetric interval matrix is a P-matrix if and only…
Expand
1987
1987
Algorithms to Process Distributed Queries in Fast Local Networks
Clement T. Yu
,
Keh-Chang Guh
,
Weining Zhang
,
M. Templeton
,
David Brill
,
Arbee L. P. Chen
IEEE transactions on computers
1987
Corpus ID: 38952407
We propose a scheme to make use of semantic information to process distributed queries locally without data transfer with respect…
Expand