Exact polynomial factorization by approximate high degree algebraic numbers

DOI10.1145/1577190.1577199MaRDI QIDQ2959014zbMATHOpenAlexWikidataFDO

Authors Jingwei Chen, Yong Feng, Xiaolin Qin, Jingzhong Zhang

Publication date 3 February 2017

Published in Proceedings of the 2009 conference on Symbolic numeric computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1577190.1577199

zbMATH Keywords

approximationfactorizationpolynomialalgebraic number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algorithms for approximation of functions (65D15) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 3924142
• Towards factoring bivariate approximate polynomials
• scientific article; zbMATH DE number 3906595
• Factoring multivariate polynomials via partial differential equations
• Factoring Multivariate Polynomials over Algebraic Number Fields

Cited in

(4)

• Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
• scientific article; zbMATH DE number 3924142 (Why is no real title available?)
• Approximate factorization of polynomials in Z[x]
• A note on separated factors of separated polynomials

This page was built for publication: Exact polynomial factorization by approximate high degree algebraic numbers

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