On the complexity of matrix reduction over finite fields
DOI10.1016/J.AAM.2006.08.008zbMATH Open1132.65018OpenAlexW2071297168MaRDI QIDQ2467342FDOQ2467342
Klas Markström, Lars Hellström, Daniel Andrén
Publication date: 21 January 2008
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2006.08.008
Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matrices over special rings (quaternions, finite fields, etc.) (15B33)
Cites Work
- A course in combinatorics.
- Finite semifields and projective planes
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- On the Evaluation of Powers and Monomials
- Diameters of finite simple groups: sharp bounds and applications
- On the interval containing at least one prime number
- The Factorization of the Ninth Fermat Number
- Techniques for Enumerating Veblen-Wedderburn Systems
- Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
- The minimum number of edges in graphs with prescribed paths
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields
- Reduction of matrices over orders of imaginary quadratic fields
- Title not available (Why is that?)
- Reducing the number of operations in certain finite- field transforms (Corresp.)
- Smallest Reduction Matrix of Binary Quadratic Forms
- An average John theorem
- Fast matrix decomposition in \(\mathbb F_2\)
- Cutoff for product replacement on finite groups
- Cutoff for a stratified random walk on the hypercube
- Uniquely pressable graphs: characterization, enumeration, and recognition
This page was built for publication: On the complexity of matrix reduction over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467342)
