1. Aaronson, S., Beigi, S., Drucker, A., Fefferman, B., Shor, P.: The power of unentanglement. In: Annual IEEE Conference on Computational Complexity, pp. 223–236 (2008).
arXiv:0804.0802
2. Aaronson S., Beigi S., Drucker A., Fefferman B., Shor P.: The power of unentanglement. Theory Comput. 5(1), 1–42 (2009)
arXiv:0804.0802
3. Altunbulak M., Klyachko A.: The Pauli principle revisited. Commun. Math. Phys. 282(2), 287–322 (2008)
arXiv:0802.0918
4. Aubrun, G., Szarek, S.J.: Dvoretzky’s theorem and the complexity of entanglement detection (2015).
arXiv:1510.00578
5. Barak, B.: Sum of squares upper bounds, lower bounds, and open questions (2014).
https://www.boazbarak.org/sos/prev/files/all-notes.pdf
. Accessed 26 Feb 2019