scientific article; zbMATH DE number 1263398
From MaRDI portal
Publication:4234290
zbMath0978.68792MaRDI QIDQ4234290
Austin A. Lobo, Erich L. Kaltofen
Publication date: 27 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials, factorization in commutative rings (13P05) Factorization (11Y05)
Related Items
Univariate polynomial factorization over finite fields ⋮ Subquadratic-time factoring of polynomials over finite fields ⋮ The black-box Niederreiter algorithm and its implementation over the binary field ⋮ Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules ⋮ An improved EZ-GCD algorithm for multivariate polynomials ⋮ Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2 ⋮ Polynomial factorization over ${\mathbb F}_2$
