Results 1 to 10 of about 35,538 (168)
Free versus bound entanglement, a NP-hard problem tackled by machine learning [PDF]
Scientific Reports, 2021 Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki criterion), in ...
Beatrix C. Hiesmayr
doaj +2 more sources
Detecting mixed-unitary quantum channels is NP-hard [PDF]
Quantum, 2020 A quantum channel is said to be a $\textit{mixed-unitary}$ channel if it can be expressed as a convex combination of unitary channels. We prove that, given the Choi representation of a quantum channel $\Phi$, it is NP-hard with respect to polynomial-time
Colin Do-Yan Lee, John Watrous
doaj +1 more source
A Heuristic Solution to the Closest String Problem Using Wave Function Collapse Techniques
IEEE Access, 2022 The Closest String Problem (CSP) is an NP-Complete problem which seeks to find the geometrical center of a set of input strings: given $k$ strings of length $L$ and a non-negative integer $d$ , construct a solution string $t$ , if it exists, such ...
Shirley Xu, David Perkins
doaj +1 more source
Many bounded versions of undecidable problems are NP-hard
SciPost Physics, 2023 Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and the membership problem for quantum correlations.
Andreas Klingler, Mirte van der Eyden, Sebastian Stengele, Tobias Reinhart, Gemma de las Cuevas
doaj +1 more source
LFG Generation from Acyclic F-Structures is NP-Hard
Computational Linguistics, 2021 The universal generation problem for LFG grammars is the problem of determining whether a given grammar derives any terminal string with a given f-structure. It is known that this problem is decidable for acyclic f-structures. In this brief note, we show
Jürgen Wedekind, Ronald M. Kaplan
doaj +1 more source
Theoretical Computer Science, 2018 Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity. A successful puzzle has to be both captivating and challenging, and it has been suggested that this features are somehow related to their computational complexity \cite{Eppstein}.
ALMANZA, Matteo, Leucci S., Panconesi A.
openaire +7 more sources
Tile Packing Tomography is NP-hard [PDF]
Algorithmica, 2009 Discrete tomography deals with reconstructing finite spatial objects from their projections. The objects we study in this paper are called tilings or tile-packings, and they consist of a number of disjoint copies of a fixed tile, where a tile is defined as a connected set of grid points.
Chrobak, Marek +4 more
openaire +7 more sources
An overview on polynomial approximation of NP-hard problems [PDF]
Yugoslav Journal of Operations Research, 2009 The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between
Paschos Vangelis Th.
doaj +1 more source
Automating Resolution is NP-Hard [PDF]
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019 We show that the problem of finding a Resolution refutation that is at most polynomially longer than a shortest one is NP-hard. In the parlance of proof complexity, Resolution is not automatable unless P = NP. Indeed, we show that it is NP-hard to distinguish between formulas that have Resolution refutations of polynomial length and those that do not ...
Atserias, Albert, Muller, Moritz Martin
openaire +5 more sources
IEEE Access, 2023 Financial portfolio construction problems are often formulated as quadratic and discrete (combinatorial) optimization that belong to the nondeterministic polynomial time (NP)-hard class in computational complexity theory.
Kosuke Tatsumura +4 more
doaj +1 more source