Practical divide-and-conquer algorithms for polynomial arithmetic

DOI10.1007/978-3-642-23568-9_16zbMATH Open1308.12007OpenAlexW1870098933MaRDI QIDQ3090902FDOQ3090902

Authors:

Publication date: 2 September 2011

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23568-9_16

Recommendations

• scientific article
• Fast polynomial factorization and modular composition
• Composition modulo powers of polynomials
• On short multiplications and divisions
• In-place arithmetic for univariate polynomials over an algebraic number field

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Symbolic computation and algebraic computation (68W30)

Cited In (7)

• In-place arithmetic for univariate polynomials over an algebraic number field
• Title not available (Why is that?)
• Separating linear forms and rational univariate representations of bivariate systems
• Univariate real root isolation in an extension field and applications
• Nearly optimal refinement of real roots of a univariate polynomial
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• FLINT
• Magma
• NTL

This page was built for publication: Practical divide-and-conquer algorithms for polynomial arithmetic

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