Epsilon-Net Method for Optimizations over Separable States
From MaRDI portal
Publication:2843302
DOI10.1007/978-3-642-31594-7_67zbMath1272.68136arXiv1112.0808OpenAlexW1749717110MaRDI QIDQ2843302
Publication date: 12 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.0808
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (1)
This page was built for publication: Epsilon-Net Method for Optimizations over Separable States
