Login / Signup

Strong NP-hardness of the quantum separability problem.

Sevag Gharibian
Published in: Quantum Inf. Comput. (2010)
Keyphrases
  • np hardness
  • np hard
  • approximation algorithms
  • mixed integer
  • worst case analysis
  • scheduling problem
  • linear programming
  • discrete tomography
  • training data
  • multi agent systems
  • special case
  • dimensionality reduction