Results 31 to 40 of about 3,990 (244)
Automating cutting planes is NP-hard [PDF]
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020 Full version of the conference version at STOC 2020 by the same ...
Göös, Mika +3 more
openaire +2 more sources
Restrained Italian reinforcement number in graphs
AKCE International Journal of Graphs and Combinatorics, 2023 A restrained Italian dominating function (RID-function) on a graph [Formula: see text] is a function [Formula: see text] satisfying: (i) [Formula: see text] for every vertex [Formula: see text] with [Formula: see text], where [Formula: see text] is the ...
N. Ebrahimi +3 more
doaj +1 more source
On Basing One-way Permutations on NP-hard Problems under Quantum Reductions [PDF]
Quantum, 2020 A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case reductions.
Nai-Hui Chia, Sean Hallgren, Fang Song
doaj +1 more source
Most Tensor Problems Are NP-Hard [PDF]
Journal of the ACM, 2013 We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor possesses a given eigenvalue, singular value, or spectral norm; approximating an eigenvalue, eigenvector, singular ...
Hillar, Christopher, Lim, Lek-Heng
openaire +2 more sources
Fast approximation algorithms for some maximin clustering problems [PDF]
Yugoslav Journal of Operations ResearchIn this paper, we consider three cases of an intractable problem of searching for two subsets in a finite set of points of Euclidean space. In all three cases, it is required to maximize the minimum cluster’s cardinality under constraint on each cluster ...
Khandeev V., Neshchadim S.
doaj +1 more source
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bauer, D. +3 more
openaire +2 more sources
On the Computational Complexity of Optimization Convex Covering Problems of Graphs [PDF]
Computer Science Journal of Moldova, 2020 In this paper we present further studies of convex covers and convex partitions of graphs. Let $G$ be a finite simple graph. A set of vertices $S$ of $G$ is convex if all vertices lying on a shortest path between any pair of vertices of $S$ are in $S ...
Radu Buzatu
doaj
Comparing copy-number profiles under multi-copy amplifications and deletions
BMC Genomics, 2020 Background During cancer progression, malignant cells accumulate somatic mutations that can lead to genetic aberrations. In particular, evolutionary events akin to segmental duplications or deletions can alter the copy-number profile (CNP) of a set of ...
Garance Cordonnier, Manuel Lafond
doaj +1 more source
, 2018 In this paper, we show that deciding rigid foldability of a given crease pattern using all creases is weakly NP-hard by a reduction from Partition, and that deciding rigid foldability with optional creases is strongly NP-hard by a reduction from 1-in-3 SAT.
Akitaya, Hugo +5 more
openaire +2 more sources
Scanning Phylogenetic Networks Is NP-hard [PDF]
, 2020 Phylogenetic networks are rooted directed acyclic graphs used to depict the evolution of a set of species in the presence of reticulate events. Reconstructing these networks from molecular data is challenging and current algorithms fail to scale up to genome-wide data.
Berry, Vincent +2 more
openaire +2 more sources