Almost complete solution for the NP-hard separability problem of Bell diagonal qutrits
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2045-2322
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Almost complete solution for the NP-hard separability problem of Bell diagonal qutrits ; volume:12 ; number:1 ; day:21 ; month:7 ; year:2022 ; pages:1-12 ; date:12.2022
Scientific reports ; 12, Heft 1 (21.7.2022), 1-12, 12.2022
- Urheber
-
Popp, Christopher
Hiesmayr, Beatrix C.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1038/s41598-022-16225-z
- URN
-
urn:nbn:de:101:1-2022093023224497734744
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:31 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Popp, Christopher
- Hiesmayr, Beatrix C.
- SpringerLink (Online service)
Ähnliche Objekte (12)
Approximating good simultaneous diophantine approximations is almost NP-hard
Automating Resolution is NP-Hard
Pool resolution is NP-hard to recognize
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Computing the Interleaving Distance is NP-Hard
Robust Geometric Programming is co-NP hard
Approximation of Almost Diagonal Non-linear Maps by Lattice Lipschitz Operators
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Deadlock-Detection in Component-Based Systems is NP-hard.
De Bruijn Superwalk with Multiplicities Problem is NP-hard
Approximating good simultaneous diophantine approximations is almost NP-hard
Automating Resolution is NP-Hard
Pool resolution is NP-hard to recognize
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Computing the Interleaving Distance is NP-Hard
Robust Geometric Programming is co-NP hard
Approximation of Almost Diagonal Non-linear Maps by Lattice Lipschitz Operators
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Deadlock-Detection in Component-Based Systems is NP-hard.
De Bruijn Superwalk with Multiplicities Problem is NP-hard
Approximating good simultaneous diophantine approximations is almost NP-hard
Automating Resolution is NP-Hard
Pool resolution is NP-hard to recognize
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Computing the Interleaving Distance is NP-Hard
Robust Geometric Programming is co-NP hard
Approximation of Almost Diagonal Non-linear Maps by Lattice Lipschitz Operators
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Deadlock-Detection in Component-Based Systems is NP-hard.