Yüklüyor......
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...
Kaydedildi:
| Yayımlandı: | J Autom Reason |
|---|---|
| Asıl Yazarlar: | , , , |
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Springer Netherlands
2019
|
| Konular: | |
| Online Erişim: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7115093/ https://ncbi.nlm.nih.gov/pubmed/32269396 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s10817-019-09526-y |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|