Citace podle APA (7th ed.)

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

Citace podle Chicago (17th ed.)

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.

Citace podle MLA (9th ed.)

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.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..