Lairez, P. (2017). A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time. Foundations of computational mathematics, 17(5), 1265-1292. https://doi.org/10.1007/s10208-016-9319-7
Chicago Style (17th ed.) CitationLairez, Pierre. "A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time." Foundations of Computational Mathematics 17, no. 5 (2017): 1265-1292. https://doi.org/10.1007/s10208-016-9319-7.
MLA (9th ed.) CitationLairez, Pierre. "A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time." Foundations of Computational Mathematics, vol. 17, no. 5, 2017, pp. 1265-1292, https://doi.org/10.1007/s10208-016-9319-7.