Some algorithms related to matrices with entries in a finite field

DOI10.1080/09720529.2009.10698252MaRDI QIDQ3560577zbMATH OpenOpenAlexFDO

Authors

Publication date 14 May 2010

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2009.10698252

zbMATH Keywords

algorithmsrankcomplexityfinite fieldsdeterminantsmatrix inversionmatrix-matrix productskernel(matrix)linearly independent rows

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Vector spaces, linear dependence, rank, lineability (15A03) Numerical computation of determinants (65F40)

Recommendations

• scientific article; zbMATH DE number 4152523
• On the complexity of matrix reduction over finite fields
• On the complexity of inverting integer and polynomial matrices
• On practical algorithms for accelerated matrix multiplication
• Solving sparse linear equations over finite fields

Cites work

• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• Matrix multiplication via arithmetic progressions
• On the Complexity of Matrix Product

Cited in

(1)

• On the complexity of matrix reduction over finite fields

Describes a project that uses

Uses Software

• matrixss
• GAP

This page was built for publication: Some algorithms related to matrices with entries in a finite field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560577)