APA (7th ed.) Citation

Hopkins, S. B., Schramm, T., & Trevisan, L. (2020, November). Subexponential LPs Approximate Max-Cut. Proceedings / annual Symposium on Foundations of Computer Science, 943-953. https://doi.org/10.1109/FOCS46700.2020.00092

Chicago Style (17th ed.) Citation

Hopkins, Samuel B., Tselil Schramm, and Luca Trevisan. "Subexponential LPs Approximate Max-Cut." Proceedings / Annual Symposium on Foundations of Computer Science Nov. 2020: 943-953. https://doi.org/10.1109/FOCS46700.2020.00092.

MLA (9th ed.) Citation

Hopkins, Samuel B., et al. "Subexponential LPs Approximate Max-Cut." Proceedings / Annual Symposium on Foundations of Computer Science, Nov. 2020, pp. 943-953, https://doi.org/10.1109/FOCS46700.2020.00092.