Checking strict positivity of Kraus maps is NP-hard (Q344532)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Checking strict positivity of Kraus maps is NP-hard |
scientific article; zbMATH DE number 6655345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Checking strict positivity of Kraus maps is NP-hard |
scientific article; zbMATH DE number 6655345 |
Statements
Checking strict positivity of Kraus maps is NP-hard (English)
0 references
23 November 2016
0 references
computational complexity
0 references
algorithms
0 references
analysis of algorithms
0 references
0 references
0 references
0 references
0 references
0.7147039771080017
0 references
0.7003845572471619
0 references
0.691544234752655
0 references
0.6897826194763184
0 references
