Results 51 to 60 of about 460,881 (203)
On the Complexity of Optimal k-Anonymity: A New Proof Based on Graph Coloring
IEEE AccessPrivacy is a complex balancing problem between risks and utility of data. K-anonymity, a fundamental model for preserving privacy, guarantees that an item cannot be differentiated from at least k-1 other items.
Yavuz Canbay
doaj +1 more source
Minimum weight triangulation is NP-hard [PDF]
Proceedings of the twenty-second annual symposium on Computational geometry, 2006 A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S . In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge lengths.
Wolfgang Mulzer, Günter Rote
openaire +3 more sources
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
Self-concordance is NP-hard [PDF]
Journal of Global Optimization, 2016 We give an elementary proof of a somewhat curious result, namely, that deciding whether a convex function is self-concordant is in general an intractable problem.
openaire +5 more sources
Computing the Interleaving Distance is NP-Hard [PDF]
Foundations of Computational Mathematics, 2019 Abstract We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are 1-interleaved is NP-complete, already for bigraded, interval decomposable modules.
Håvard Bakke Bjerkevik +2 more
openaire +4 more sources
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.
Douglas Bauer +3 more
openaire +2 more sources
Solving NP-SPEC Domains Using ASP [PDF]
, 2013 NP-SPEC is a language for specifying problems in NP in a declarative way. Despite the fact that the semantics of the language was given by referring to Datalog with circumscription, which is very close to ASP, so far the only existing implementations are
Alviano, Mario, Faber, Wolfgang
core +3 more sources
Half-duplex routing is NP-hard [PDF]
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017 Routing is a widespread approach to transfer information from a source node to a destination node in many deployed wireless ad-hoc networks. Today's implemented routing algorithms seek to efficiently find the path/route with the largest Full-Duplex (FD) capacity, which is given by the minimum among the point-to-point link capacities in the path.
Yahya H. Ezzeldin +3 more
openaire +3 more sources
Alignment of cluster complexity at network systems [PDF]
FME Transactions, 2019 This paper considers data management structures and cluster technologies in large-scale networks. Suboptimal network partitioning problems are formulated on the base of complexity index alignment.
Enaleev A.K., Ciganov Vladimir V.
doaj
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 ...
Christopher J. Hillar, Lek-Heng Lim
openaire +2 more sources