Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Sevag Gharibian, Ojas Parekh. Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. In Dimitris Achlioptas, László A. Végh, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. Volume 145 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

This author has not been identified. Look up 'Sevag Gharibian' in GoogleThis author has not been identified. Look up 'Ojas Parekh' in Google

runs on WebDSL