A New Black Box Factorization Algorithm - the Non-monic Case

DOI10.1145/3597066.3597119OpenAlexW4383221855WikidataQ130924355 ScholiaQ130924355MaRDI QIDQ6060365

Tian Chen, Michael B. Monagan

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

zbMATH Keywords

multivariate polynomial factorizationbivariate Hensel liftingblack box representationsparse Hensel lifting

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpolating polynomials from their values
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• Sparse multivariate Hensel lifting: a high-performance design and implementation
• Factoring multivariate polynomials with many factors and huge coefficients
• The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization
• The complexity of sparse Hensel lifting and sparse polynomial factorization
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
• Using Sparse Interpolation in Hensel Lifting
• Modern Computer Algebra
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• The Distribution of Galois Groups and Hilbert's Irreducibility Theorem
• P-adic reconstruction of rational numbers
• Factoring Multivariate Polynomials Over the Integers
• Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
• An Improved Multivariate Polynomial Factoring Algorithm
• What Can (and Can't) we Do with Sparse Polynomials?
• Linear Hensel Lifting for Fp[x,y and Z[x] with Cubic Cost]
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

This page was built for publication: A New Black Box Factorization Algorithm - the Non-monic Case