Euclid’s algorithm and the Lanczos method over finite fields
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4153897
- A reliable block Lanczos algorithm over small finite fields
- Analysis of Euclidean algorithms for polynomials over finite fields
- scientific article; zbMATH DE number 1676636
- New recurrence relationships between orthogonal polynomials which lead to new Lanczos-type algorithms
Cites work
- Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
- scientific article; zbMATH DE number 1676636 (Why is no real title available?)
- scientific article; zbMATH DE number 3763165 (Why is no real title available?)
- On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Solving linear equations over GF(2): Block Lanczos algorithm
- Solving sparse linear equations over finite fields
Cited in
(8)- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Cohomology of congruence subgroups of \(\text{SL}_4(\mathbb Z)\)
- The polynomial Euclidean algorithm and the linear equation \(AX + BY = \gcd(A, B)\)
- scientific article; zbMATH DE number 6693374 (Why is no real title available?)
- The Euclidean algorithm in quintic and septic cyclic fields
- scientific article; zbMATH DE number 4153897 (Why is no real title available?)
- Cohomology of congruence subgroups of $ {SL}_4(\mathbb {Z})$. III
- scientific article; zbMATH DE number 5635243 (Why is no real title available?)
This page was built for publication: Euclid’s algorithm and the Lanczos method over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210963)
