“…In this paper we show that this problem is NP-hard. Combined with results of previous works it means that all known models for genome assembly are NP-hard.…”
Enlace del recurso
Enlace del recurso
Enlace del recurso

Enlace del recurso
Enlace del recurso
Enlace del recurso

“…Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. …”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…The standard pooling problem is a NP-hard subclass of non-convex quadratically-constrained optimization problems that commonly arises in process systems engineering applications. …”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…We show that the problem of finding a correct ensemble of bireducts with the lowest cardinalities of subsets [Formula: see text] is NP-hard.…”
Enlace del recurso
Enlace del recurso

“…BACKGROUND: Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. …”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…Since this problem is NP-hard, research so far concentrated on polynomial-time approximation algorithms and tractable special cases. …”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…The two NP-hard problems we are trying to solve are closest string and closest substring. …”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…The minimum vertex cover (MVC) problem is a canonical NP-hard combinatorial optimization problem aiming to find the smallest set of vertices such that every edge has at least one endpoint in the set. …”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…This paper proposes an optimization system for solving an NP-hard problem by using several new algorithms and application programs. …”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…Furthermore, these graph-based NP-hard problems are solved on memristive networks, and coupled with Cellular Automata (CA)-inspired computational schemes that enable computation within memory. …”
Enlace del recurso
Enlace del recurso

“…We prove that the general problem is NP-hard in the strong sense. We also demonstrate that the problem with equal processing times on the machine is NP-hard. …”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…Unfortunately, [Formula: see text] -minimization is actually NP-hard. The most widely studied approach to this NP-hard problem is based on solving [Formula: see text] -minimization ([Formula: see text] ). …”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…We prove that Tracking Paths is NP-hard in graphs with bounded maximum degree [Formula: see text], and give a [Formula: see text]-approximate algorithm for the same. …”
Enlace del recurso
Enlace del recurso

“…The problem is first proven NP-hard when sensors are with different velocities in this paper. …”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…Because we can simulate the quantum circuits that implement GA in different highly configurable noise models and even run GA on actual quantum computers, we can analyze this class of heuristic methods in the quantum context for NP-hard problems. This paper proposes an instantiation of the Reduced Quantum Genetic Algorithm (RQGA) that solves the NP-hard graph coloring problem in O(N(1/2)). …”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…The minimization of network coding resources, such as coding nodes and links, is a challenging task, not only because it is a NP-hard problem, but also because the problem scale is huge; for example, networks in real world may have thousands or even millions of nodes and links. …”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…We conclude with a discussion of why, despite the NP-hardness, both the parsimony and likelihood problem can likely be well-solved in practice.…”
Enlace del recurso
Enlace del recurso
Enlace del recurso

“…NP-hard combinatorial optimization problems are pivotal in science and business. …”
Enlace del recurso
Enlace del recurso

“…Due to NP-hard complexity of service composition, many metaheuristic algorithms have been used so far. …”
Enlace del recurso
Enlace del recurso
Enlace del recurso