Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
From MaRDI portal
Publication:2680117
DOI10.1007/s11786-022-00534-7OpenAlexW4297880405MaRDI QIDQ2680117
Publication date: 27 January 2023
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-022-00534-7
determinant algorithmsmultivariate polynomial factorizationblack box representationsparse hensel lifting
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing the determinant in small parallel time using a small number of processors
- Interpolating polynomials from their values
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Irreducibility of multivariate polynomials
- 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
- Improved dense multivariate polynomial factorization algorithms
- Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
- Using Sparse Interpolation in Hensel Lifting
- Modern Computer Algebra
- Effective Hilbert irreducibility
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Factoring Multivariate Polynomials Over the Integers
- Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
- What Can (and Can't) we Do with Sparse Polynomials?
- Linear Hensel Lifting for Fp[x,y and Z[x] with Cubic Cost]
- The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
- Systems of distinct representatives and linear algebra
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination