New Sparse Multivariate Polynomial Factorization Algorithms over Integers

DOI10.1145/3597066.3597087MaRDI QIDQ6060389zbMATH OpenFDO

Authors Qiao-Long Huang, Xiao-Shan Gao

Publication date 3 November 2023

Published in Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

polynomial complexitypolynomial factorizationsparse multivariate polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• A New Algorithm for Factoring Polynomials Over Finite Fields
• An Improved Multivariate Polynomial Factoring Algorithm
• Complexity issues in bivariate polynomial factorization
• Computing Frobenius maps and factoring polynomials
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• Deterministic factorization of sparse polynomials with bounded individual degree
• Deterministically factoring sparse polynomials into multilinear factors and sums of univariate polynomials
• Effective Hilbert irreducibility
• Factoring Multivariate Polynomials Over the Integers
• Factoring multivariate polynomials with many factors and huge coefficients
• Factoring Polynomials Over Large Finite Fields
• Factoring polynomials with rational coefficients
• Factoring sparse multivariate polynomials
• Factors of low individual degree polynomials
• Fast polynomial factorization and modular composition
• scientific article; zbMATH DE number 3977110 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 3757697 (Why is no real title available?)
• scientific article; zbMATH DE number 1263216 (Why is no real title available?)
• scientific article; zbMATH DE number 481965 (Why is no real title available?)
• scientific article; zbMATH DE number 7095992 (Why is no real title available?)
• scientific article; zbMATH DE number 3265895 (Why is no real title available?)
• Irreducibility of multivariate polynomials
• Modern computer algebra
• On Hensel factorization. I
• On the complexity of factoring bivariate supersparse (lacunary) polynomials
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• The complexity of sparse Hensel lifting and sparse polynomial factorization
• Using sparse interpolation in Hensel lifting

Cited in

(4)

• A theory and an algorithm for computing sparse multivariate polynomial remainder sequence
• The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization
• Improved dense multivariate polynomial factorization algorithms
• A new sparse polynomial GCD by separating terms

This page was built for publication: New Sparse Multivariate Polynomial Factorization Algorithms over Integers

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