Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Berlekamp–Zassenhaus algorithm

Known as: Berlekamp-Zassenhaus algorithm 
In mathematics, in particular in computational algebra, the Berlekamp–Zassenhaus algorithm is an algorithm for factoring polynomials over the… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We formalize the Berlekamp–Zassenhaus algorithm for factoring square-free integer polynomials in Isabelle/HOL. We further adapt… Expand
  • table 1
  • figure 1
Is this relevant?
2016
2016
We formalize the Berlekamp-Zassenhaus algorithm for factoring square-free integer polynomials in Isabelle/HOL. We further adapt… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The problem of factoring a polynomial in a single or severalvariables over a finite field, the rational numbers or the… Expand
Is this relevant?