Hardness of Approximation for Quantum Problems.
Sevag GharibianJulia KempePublished in: ICALP (1) (2012)
Keyphrases
- np complete
- np hardness
- data mining
- learning algorithm
- neural network
- multiscale
- computational complexity
- np hard
- problems involving
- benchmark problems
- optimization problems
- approximation schemes
- solving problems
- closed form
- application domains
- upper bound
- dynamic programming
- image segmentation
- case study
- feature selection