Loading...
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...
Na minha lista:
| Udgivet i: | J Autom Reason |
|---|---|
| Main Authors: | , , , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Springer Netherlands
2019
|
| Fag: | |
| Online adgang: | 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 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|