Improvements of convex-dense factorization of bivariate polynomials
From MaRDI portal
Cites work
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- Algebraic osculation and application to factorization of sparse polynomials
- Algebroid curves in positive characteristic
- Bivariate factorization using a critical fiber
- Computing Puiseux series: a fast divide and conquer algorithm
- Computing the equisingularity type of a pseudo-irreducible polynomial
- Decomposition of polytopes and polynomials
- Division and slope factorization of p-adic polynomials
- Factoring multivariate polynomials via partial differential equations
- Factoring polynomials via polytopes
- Factorization of polynomials and some linear-algebra problems over finite fields
- Fast separable factorization and applications
- Four lectures on polynomial absolute factorization
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- Improving complexity bounds for the computation of Puiseux series over finite fields
- Lifting and recombination techniques for absolute factorization
- Local polynomial factorisation. Improving the montes algorithm
- Modern computer algebra
- New bounds for matrix multiplication: from alpha to omega
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- On the bit-complexity of sparse polynomial and series multiplication
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Structured FFT and TFT: symmetric and lattice polynomials
This page was built for publication: Improvements of convex-dense factorization of bivariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310026)
