Sparse multivariate Hensel lifting: a high-performance design and implementation
From MaRDI portal
Publication:1662273
Recommendations
- 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
- scientific article; zbMATH DE number 1262433
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
- Parallel and cache-efficient Hensel lifting
Cited in
(13)- The complexity of sparse Hensel lifting and sparse polynomial factorization
- On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation
- Parallel and cache-efficient Hensel lifting
- Factoring sparse bivariate polynomials using the priority queue
- Using sparse interpolation in Hensel lifting
- High performance implementation of factoring multivariate polynomials based on NTL
- Parallelization of triangular decompositions: techniques and implementation
- On factorization of multivariate polynomials over algebraic number and function fields
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
- A New Black Box Factorization Algorithm - the Non-monic Case
- scientific article; zbMATH DE number 3977110 (Why is no real title available?)
- Factoring multivariate polynomials with many factors and huge coefficients
- Fast interpolation of multivariate polynomials with sparse exponents
This page was built for publication: Sparse multivariate Hensel lifting: a high-performance design and implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662273)