APA (7th ed.) Citation

Williams, R. R. (2021, June 29). Complexity Lower Bounds from Algorithm Design. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1-3. https://doi.org/10.1109/LICS52264.2021.9470522

Chicago Style (17th ed.) Citation

Williams, R. Ryan. "Complexity Lower Bounds from Algorithm Design." Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science 29 Jun. 2021: 1-3. https://doi.org/10.1109/LICS52264.2021.9470522.

MLA (9th ed.) Citation

Williams, R. Ryan. "Complexity Lower Bounds from Algorithm Design." Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 29 Jun. 2021, pp. 1-3, https://doi.org/10.1109/LICS52264.2021.9470522.