Checking the strict positivity of Kraus maps is NP-hard.
Stephane GaubertZheng QuPublished in: CoRR (2014)
Keyphrases
- np hard
- lower bound
- special case
- np complete
- optimal solution
- linear programming
- computational complexity
- worst case
- scheduling problem
- approximation algorithms
- branch and bound algorithm
- closely related
- default reasoning
- np hardness
- minimum cost
- integer programming
- greedy heuristic
- data sets
- knapsack problem
- expert systems
- multiscale
- website
- consistency checking
- artificial intelligence
- real time
- computationally challenging
- remains np hard