The Factorization Algorithm of Berlekamp and Zassenhaus
From MaRDI portal
- Algebraic numbers in Isabelle/HOL
- An Inequality About Factors of Polynomials
- Automated Deduction – CADE-20
- Certification of complexity proofs using CeTA
- Certification of Termination Proofs Using CeTA
- Code generation via higher-order rewrite systems
- Complexity analysis of term rewriting based on matrix and context dependent interpretations
- Construction of real algebraic numbers in Coq
- Data refinement in Isabelle/HOL
- Factoring polynomials and the knapsack problem
- Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
- Formalization and execution of linear algebra: from theorems to algorithms
- Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs
- Formally verified certificate checkers for hardest-to-round computation
- From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals
- From types to sets by local type definitions in higher-order logic
- Gaussian elimination is not optimal
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Isabelle/HOL. A proof assistant for higher-order logic
- Joint spectral radius theory for automated complexity analysis of rewrite systems
- Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL
- Matrix interpretations for proving termination of term rewriting
- Matrix Theory
- Modular complexity analysis for term rewriting
- On Hensel factorization. I
- Polynomially bounded matrix interpretations
- Polynomials. Translated from the second Russian edition by Dimitry Leites.
- Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
- Proving termination of programs automatically with AProVE
- Revisiting matrix interpretations for polynomial derivational complexity of term rewriting
- Subresultants and Reduced Polynomial Remainder Sequences
- Termination Competition (termCOMP 2015)
- The HOL Light theory of Euclidean space
- The Subresultant PRS Algorithm
- Theory of algebraic numbers. Vol. 1
- Treatise on algebraic substitutions.
- Tyrolean Complexity Tool: Features and Usage.
- Verified indifferentiable hashing into elliptic curves
Cited in
(11)- Number Theoretic Transform
- The Oneway to Hiding Theorem
- Fisher's Inequality: Linear Algebraic Proof Techniques for Combinatorics
- Linear Recurrences
- Hardness of Lattice Problems
- A verified algorithm for computing the Smith normal form of a matrix
- Set Reconciliation
- Perfect Fields
- A verified LLL algorithm
- Algebraic Numbers in Isabelle/HOL
- CRYSTALS-Kyber
This page was built for software: The Factorization Algorithm of Berlekamp and Zassenhaus
