Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree

From MaRDI portal
















This page was built for publication: Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7330274)