A quasipolynomial-time algorithm for the quantum separability problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Fernando G. S. L. Brandão, Matthias Christandl, Jon Yard. A quasipolynomial-time algorithm for the quantum separability problem. In Lance Fortnow, Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. pages 343-352, ACM, 2011. [doi]

This author has not been identified. Look up 'Fernando G. S. L. Brandão' in GoogleThis author has not been identified. Look up 'Matthias Christandl' in GoogleThis author has not been identified. Look up 'Jon Yard' in Google

runs on WebDSL