Approximate factorization of polynomials over Z

DOI10.1145/1577190.1577216zbMATH Open1356.13031OpenAlexW2082763090MaRDI QIDQ2959031FDOQ2959031

Authors: Tateaki Sasaki, Yasutaka Ookura 

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.1577216

Recommendations

• Approximate factorization of polynomials in Z[x]
• Analysis of approximate factorization algorithm. I
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Towards factoring bivariate approximate polynomials
• Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots

zbMATH Keywords

sum of powers of rootsapproximate factorization over \(\mathbb{Z}\)factor-differentiated polynomialsknapsack method

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)

Cited In (7)

• Approximate factorization of polynomials in Z[x]
• The approximate irreducible factorization of a univariate polynomial. Revisited
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Real factorization of multivariate polynomials with integer coefficients
• Analysis of approximate factorization algorithm. I

This page was built for publication: Approximate factorization of polynomials over Z

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