Accelerating the factorization of multilinear Boolean polynomials
From MaRDI portal
Cites work
- A fast parallel sparse polynomial GCD algorithm
- A New Black Box Factorization Algorithm - the Non-monic Case
- A new sparse polynomial GCD by separating terms
- Algorithms for the non-monic case of the sparse modular GCD algorithm
- An Improved Multivariate Polynomial Factoring Algorithm
- 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 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1254255 (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
- Modern computer algebra
- On a polytime factorization algorithm for multilinear polynomials over \(\mathbb{F}_2\)
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On the relation between polynomial identity testing and finding variable disjoint factors
- P-adic reconstruction of rational numbers
- Sparse Hensel lifting algorithms for multivariate polynomial factorization. (Abstract of Doctoral Dissertation)
- The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization
- The EEZ-GCD algorithm
This page was built for publication: Accelerating the factorization of multilinear Boolean polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446162)