Algebraic complexities and algebraic curves over finite fields
- 1 December 1988
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 4 (4), 285-316
- https://doi.org/10.1016/0885-064x(88)90012-x
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Codes and informationRussian Mathematical Surveys, 1984
- Computing lower bounds on tensor rank over finite fieldsJournal of Computer and System Sciences, 1982
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert boundMathematische Nachrichten, 1982
- On the algorithmic complexity of associative algebrasTheoretical Computer Science, 1981
- Computations of Bilinear Forms over Finite FieldsJournal of the ACM, 1980
- On the optimal evaluation of a set of bilinear formsLinear Algebra and its Applications, 1978
- Algebras Having Linear Multiplicative ComplexitiesJournal of the ACM, 1977
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- Some bilinear forms whose multiplicative complexity depends on the field of constantsTheory of Computing Systems, 1976
- The fast Fourier transform in a finite fieldMathematics of Computation, 1971