Classical deterministic complexity of edmonds’ problem and quantum entanglement. (2003)

by Leonid Gurvits
Venue:In Proceedings of the 35th Annual ACM Symposium on Theory of Computing,