1. Grötschel, M., Lovász, L. Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol. 2, second corrected edition edn., Springer (1993)
2. Liu, Y.K.: The complexity of the consistency and N-representability problems for quantum states. Ph.D. thesis, University of California, San Diego (2007)
arXiv:0712.3041
3. Harrow, A.W., Montanaro, A.: Testing product states, quantum Merlin–Arthur games and tensor optimization. J. ACM 60(1), 3:1 (2013).
arXiv:1001.0017
4. Beigi, S., Shor, P.W.: Approximating the set of separable states using the positive partial transpose test. J. Math. Phys. 51(4), 042202 (2010)
arXiv:0902.1806
5. Gall, F.L., Nakagawa, S., Nishimura, H.: On QMA protocols with two short quantum proofs. Q. Inf. Comp. 12, 589 (2012)
arXiv:1108.4306