Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,539,853 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Algorithm
Berlekamp's algorithm
Polynomial
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A formalization of the Berlekamp-Zassenhaus factorization algorithm
Jose Divasón
,
Sebastiaan J. C. Joosten
,
René Thiemann
,
Akihisa Yamada
Certified Programs and Proofs
2017
Corpus ID: 15648757
We formalize the Berlekamp–Zassenhaus algorithm for factoring square-free integer polynomials in Isabelle/HOL. We further adapt…
Expand
Highly Cited
2003
Highly Cited
2003
Polynomial factorization: a success story
E. Kaltofen
International Symposium on Symbolic and Algebraic…
2003
Corpus ID: 6563627
The problem of factoring a polynomial in a single or severalvariables over a finite field, the rational numbers or the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE