View of FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials

Return to Article Details FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials Download Download PDF