A note on Gao's algorithm for polynomial factorization
From MaRDI portal
Publication:633632
DOI10.1016/j.tcs.2010.11.048zbMath1221.12014OpenAlexW2055816478MaRDI QIDQ633632
Vilmar Trevisan, Carlos Hoppen, Virgínia M. Rodrigues
Publication date: 29 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.048
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Sparse bivariate polynomial factorization ⋮ A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Factoring polynomials with rational coefficients
- Fast multiplication of polynomials over fields of characteristic 2
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
- A new efficient factorization algorithm for polynomials over small finite fields
- Lifting and recombination techniques for absolute factorization
- Fast separable factorization and applications
- Improved dense multivariate polynomial factorization algorithms
- Hensel lifting and bivariate polynomial factorisation over finite fields
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Topology and factorization of polynomials
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Factoring multivariate polynomials via partial differential equations
- Factoring Polynomials Over Large Finite Fields
- Factoring polynomials over finite fields: A survey
This page was built for publication: A note on Gao's algorithm for polynomial factorization