scientific article
From MaRDI portal
Publication:3971984
zbMath0773.11078MaRDI QIDQ3971984
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyalgorithmsbibliographyfinite fieldsfactoring polynomialslattice reductionroot approximationbivariate factoringmultivariate factoring
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Polynomials over finite fields (11T06) Research exposition (monographs, survey articles) pertaining to field theory (12-02)
Related Items (17)
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Computing Frobenius maps and factoring polynomials ⋮ Lifting and recombination techniques for absolute factorization ⋮ An efficient algorithm for factoring polynomials over algebraic extension field ⋮ Univariate polynomial factorization over finite fields ⋮ Bivariate factorization using a critical fiber ⋮ Fast separable factorization and applications ⋮ Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time ⋮ A note on Gao's algorithm for polynomial factorization ⋮ Sparse bivariate polynomial factorization ⋮ Improved dense multivariate polynomial factorization algorithms ⋮ Factoring polynomials over finite fields: A survey ⋮ New recombination algorithms for bivariate polynomial factorization based on Hensel lifting ⋮ Kronecker's and Newton's approaches to solving: a first comparison ⋮ Commensurability of 1-cusped hyperbolic 3-manifolds ⋮ Irreducibility testing over local fields ⋮ Equivalence of polynomial identity testing and polynomial factorization
This page was built for publication:
