scientific article
From MaRDI portal
Publication:2712122
zbMATH Open1006.11085MaRDI QIDQ2712122
Publication date: 6 May 2001
Title of this publication is not available (Why is that?)
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (11)
A new efficient factorization algorithm for polynomials over small finite fields ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Factoring polynomials using binary representations of finite fields ⋮ A New Algorithm for Factoring Polynomials Over Finite Fields ⋮ Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields ⋮ Title not available (Why is that?) ⋮ Algorithms for polynomial GCD computation over algebraic function fields ⋮ Factoring: algorithms, computations, and computers ⋮ Practical polynomial factoring in polynomial time ⋮ Algorithms for adaptive factorization of polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2712122)
