Leonid Gurvits. Classical deterministic complexity of Edmonds Problem and quantum entanglement. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA. pages 10-19, ACM, 2003. [doi]
Abstract is missing.