Abstract
In the vein of recent algorithmic advances in polynomial factorization based on lifting and recombination techniques, we present new faster algorithms for computing the absolute factorization of a bivariate polynomial. The running time of our probabilistic algorithm is less than quadratic in the dense size of the polynomial to be factored.
| Original language | English |
|---|---|
| Pages (from-to) | 380-420 |
| Number of pages | 41 |
| Journal | Journal of Complexity |
| Volume | 23 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Jan 2007 |
| Externally published | Yes |
Keywords
- Absolute factorization
- Absolute primality
- Polynomial factorization
Fingerprint
Dive into the research topics of 'Lifting and recombination techniques for absolute factorization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver