Computations of Bilinear Forms over Finite Fields

DOI10.1145/322217.322231zbMath0451.68034OpenAlexW2062943115MaRDI QIDQ3898026

Joseph F. Ja'Ja'

Publication date: 1980

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322217.322231

zbMATH Keywords

finite fieldsbilinear formsalgebraic complexityarithmetic complexitytensor rank

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vector and tensor algebra, theory of invariants (15A72) Quadratic and bilinear forms, inner products (15A63) Numerical linear algebra (65F99)

Related Items

Maximal bilinear complexity and codes, Maximal Rank of ${m}\times{n}\times 2$ Tensors over Arbitrary Fields, Computing lower bounds on tensor rank over finite fields, Algebraic complexities and algebraic curves over finite fields