Results 91 to 100 of about 460,881 (203)
The Tandem Duplication Distance is NP-hard
CoRR, 2019 In computational biology, tandem duplication is an important biological phenomenon which can occur either at the genome or at the DNA level. A tandem duplication takes a copy of a genome segment and inserts it right after the segment - this can be represented as the string operation $AXB \Rightarrow AXXB$.
Lafond, Manuel, Zhu, Binhai, Zou, Peng
openaire +5 more sources
NP-completeness of Bipartite Exact Cut
, 2019 \textsc{Max-Cut} is a well-known NP-complete problem in which, given a graph $G$ and an integer $k$, one needs to determine whether there exists a cut of size at least $k$ in $G$. An exact version is likewise asking whether $G$ has a cut of size exactly $
Thinh D. Nguyen (6385907)
core +1 more source
On isolating points using unit disks
Journal of Computational Geometry, 2016 Given a set of points in the plane and a set of disks (that we think of as wireless sensors) which separate the points, we consider the problem of selecting a minimum subset of the disks such that any path between any pair of points is intersected by at ...
Matt Gibson +4 more
doaj +1 more source
Stiefel optimization is NP-hard
Optimization LettersAbstract We show that linearly constrained linear optimization over a Stiefel or Grassmann manifold is NP-hard in general. We show that the same is true for unconstrained quadratic optimization over a Stiefel manifold. We will show that unless $$\textrm{P}=\textrm{NP}$$
Zehua Lai, Lek-Heng Lim, Tianyun Tang
openaire +2 more sources
The fault tolerance of NP-hard problems
Information and Computation, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Glaßer +2 more
openaire +3 more sources
Experience in the metrological characterization of primary hardness standard machines
, 2007 The Istituto Nazionale di Ricerca Metrologica (INRIM) and Galileo section of LTF S.p.a. have cooperated for many years in the field of hardness for developing and improving Primary Hardness Standards and measuring systems for their laboratories.
LIGUORI A +2 more
core
Unique Perfect Phylogeny Is NP-Hard [PDF]
, 2011 We answer, in the affirmative, the following question proposed by Mike Steel as a $100 challenge: "Is the following problem NP-hard? Given a ternary phylogenetic X-tree T and a collection Q of quartet subtrees on X, is T the only tree that displays Q ?"
Michel Habib, Juraj Stacho
openaire +3 more sources
Materials & DesignNanoporous (np) metals are used for a variety of applications including actuators, catalysts, and sensors. 3D printing enabled multi-functional design offers a pathway for enhancing performance in these applications.
Nikolaus Porenta +3 more
doaj +1 more source
Restricted optimal pebbling is NP-hard
Discrete Applied Mathematics, 2023 Consider a distribution of pebbles on a graph. A pebbling move removes two pebbles from a vertex and place one at an adjacent vertex. A vertex is reachable under a pebble distribution if it has a pebble after the application of a sequence of pebbling moves. A pebble distribution is solvable if each vertex is reachable under it.
openaire +3 more sources
Simultaneously resettable zero knowledge protocol in Public Key model
CybersecurityIn this paper, we construct a 6-round simultaneously resettable sound resettable $$(T, \epsilon )$$ ( T , ϵ ) -zero knowledge protocol for $$\mathsf {NP \cap coNP}$$ NP ∩ coNP in the Public Key model under standard assumptions, comparing with the 27 ...
Wei Zhu, Yi Deng
doaj +1 more source