A Maple program to factor multivariate polynomials given by black boxes

DOI10.1145/3717582.3717588MaRDI QIDQ7025062zbMATH OpenFDO

Authors Tian Chen, Michael Monagan

Publication date 20 February 2025

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational methods for problems pertaining to field theory (12-08) Polynomials in general fields (irreducibility, etc.) (12E05) Symbolic computation and algebraic computation (68W30)

Cites work

• A New Black Box Factorization Algorithm - the Non-monic Case
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
• scientific article; zbMATH DE number 3977110 (Why is no real title available?)
• scientific article; zbMATH DE number 1262424 (Why is no real title available?)
• scientific article; zbMATH DE number 799768 (Why is no real title available?)
• Interpolating polynomials from their values
• Linear hensel lifting for zp[x,y] for \(n\) factors with cubic cost
• Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• Sparse multivariate Hensel lifting: a high-performance design and implementation
• The complexity of sparse Hensel lifting and sparse polynomial factorization
• The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects

This page was built for publication: A Maple program to factor multivariate polynomials given by black boxes

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