1. [1] R. de Wolf, “Characterization of non-deterministic quantum query and quantum communication complexity,” Proc. 15th Annual IEEE Conference on Computational Complexity, pp.271-278, 2000.
2. [3] F. Le Gall, “Quantum weakly nondeterministic communication complexity,” Proc. 31st International Symposium on Mathematical Foundations of Computer Science, Lect. Notes Comput. Sci., vol.4162, pp.658-669, 2006.
3. [4] H. Buhrman and R. de Wolf, “Communication complexity lower bounds by polynomials,” Proc. 16th Annual IEEE Conference on Computational Complexity, pp.120-130, 2001.
4. [5] J. Hastad, “Tensor rank is NP-complete,” J. Algorithms, vol.11, no.4, pp.644-654, 1990.
5. Tensor Decompositions and Applications