Cargando…
A Verified Implementation of the Berlekamp–Zassenhaus Factorization Algorithm
We formally verify the Berlekamp–Zassenhaus algorithm for factoring square-free integer polynomials in Isabelle/HOL. We further adapt an existing formalization of Yun’s square-free factorization algorithm to integer polynomials, and thus provide an efficient and certified factorization algorithm for...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Netherlands
2019
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7115093/ https://www.ncbi.nlm.nih.gov/pubmed/32269396 http://dx.doi.org/10.1007/s10817-019-09526-y |