A lower bound for bilinear complexity of matrix multiplication over a finite field (Q6545499)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7855082
Language Label Description Also known as
default for all languages
No label defined
    English
    A lower bound for bilinear complexity of matrix multiplication over a finite field
    scientific article; zbMATH DE number 7855082

      Statements

      A lower bound for bilinear complexity of matrix multiplication over a finite field (English)
      0 references
      0 references
      29 May 2024
      0 references
      bilinear complexity
      0 references
      lower bound
      0 references
      matrix multiplication
      0 references
      finite field
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references