APA (7th ed.) Citation

Hakoniemi, T. (2021, June 29). Monomial size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1-7. https://doi.org/10.1109/LICS52264.2021.9470545

Chicago Style (17th ed.) Citation

Hakoniemi, Tuomas. "Monomial Size Vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus." Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science 29 Jun. 2021: 1-7. https://doi.org/10.1109/LICS52264.2021.9470545.

MLA (9th ed.) Citation

Hakoniemi, Tuomas. "Monomial Size Vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus." Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 29 Jun. 2021, pp. 1-7, https://doi.org/10.1109/LICS52264.2021.9470545.