A Hybrid Approach for Normal Factorization of Polynomials

DOI10.1007/11758525_54zbMATH Open1155.68597OpenAlexW1479889790MaRDI QIDQ3545103FDOQ3545103

D. S. Triantafyllou, Marilena Mitrouli, Nicos Karcanias

Publication date: 9 December 2008

Published in: Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758525_54

zbMATH Keywords

factorizationpolynomialsgreatest common divisorapproximate computations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited In (1)

• A hybrid method for computing the intersection and tangency points of plane curves

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A new polynomial factorization algorithm and its implementation 👍 👎
• A unified method for multivariate polynomial factorizations 👍 👎
• The numerical factorization of polynomials 👍 👎
• A general factorization method for multivariable polynomials 👍 👎
• A generalization of Lin's method for polynomial factorization 👍 👎
• Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases 👍 👎
• Normal factorisation of polynomials and computational issues. 👍 👎

This page was built for publication: A Hybrid Approach for Normal Factorization of Polynomials

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