Berlekamp Zassenhaus
From MaRDI portal
Software:40310
swMATH28596MaRDI QIDQ40310FDOQ40310
Author name not available (Why is that?)
Cited In (10)
- Formalizing the LLL basis reduction algorithm and the LLL factorization algorithm in Isabelle/HOL
- From types to sets by local type definition in higher-order logic
- A formalization of the Smith normal form in higher-order logic
- A verified implementation of algebraic numbers in Isabelle/HOL
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
- A formalization of the LLL basis reduction algorithm
- Classification of finite fields with applications
- Verifying asymptotic time complexity of imperative programs in Isabelle
- From LCF to Isabelle/HOL
- Comprehending Isabelle/HOL’s Consistency
This page was built for software: Berlekamp Zassenhaus
