scientific article; zbMATH DE number 1254267

zbMath0920.11083MaRDI QIDQ4227316

Jürgen Gerhard, Joachim von zur Gathen

Publication date: 23 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmspolynomial factorizationpolynomial multiplicationbinary field

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (11)

A New Algorithm for Decoding Reed-Solomon Codes ⋮ Computing special powers in finite fields ⋮ Complexity of computation in finite fields ⋮ Interval partitions and polynomial factorization ⋮ Quantum-assisted QD-CFS signatures ⋮ Faster Multiplication in GF(2)[x] ⋮ Fast transforms over finite fields of characteristic two ⋮ A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) ⋮ Unnamed Item ⋮ Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2 ⋮ Polynomial factorization over ${\mathbb F}_2$

This page was built for publication: