scientific article; zbMATH DE number 691468
From MaRDI portal
Publication:4314359
zbMath0808.11074MaRDI QIDQ4314359
Shuhong Gao, Joachim von zur Gathen
Publication date: 18 December 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
designefficiencyfinite fieldspolynomial factorizationprobabilistic algorithmBerlekamp's algorithmNiederreiter's algorithm
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (8)
Factoring multivariate polynomials via partial differential equations ⋮ Lifting and recombination techniques for absolute factorization ⋮ Univariate polynomial factorization over finite fields ⋮ Factoring polynomials over finite fields: A survey ⋮ New recombination algorithms for bivariate polynomial factorization based on Hensel lifting ⋮ A note on the factorization method of Niederreiter ⋮ The black-box Niederreiter algorithm and its implementation over the binary field ⋮ Polynomial factorization over ${\mathbb F}_2$
This page was built for publication:
