×

On the maximal multiplicative complexity of a family of bilinear forms. (English) Zbl 0416.68039


MSC:

68Q25 Analysis of algorithms and problem complexity
11E16 General binary quadratic forms
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] M.D. Atkinson and N.M. Stephens, The multiplicative complexity of two bilinear forms, in preparation.; M.D. Atkinson and N.M. Stephens, The multiplicative complexity of two bilinear forms, in preparation. · Zbl 0416.68039
[2] Atkinson, M. D.; Stephens, N. M., On the maximal rank of some special three-tensors (1977), Cardiff Univ, unpublished
[3] Brockett, R. W., On the generic degree of a 3-tensor (1976), Harvard Univ, unpublished typescript
[4] Brockett, R. W.; Dobkin, D., On the optimal evaluation of a set of bilinear forms, (Proceedings of the 5th Annual ACM Symposium on the Theory of Computing (1973)), 88-95
[5] Dobkin, D., On the complexity of a class of arithmetic computations, (Ph.D. Thesis (Sept. 1973), Harvard Univ)
[6] Dobkin, D., On the optimal evaluation of a set of \(n\)-linear forms, (Conference Record, 14th Annual Symposium on Switching and Automata Theory (1973)), 92-102, Iowa City
[7] Fiduccia, C. M.; Zalcstein, Y., Algebras having linear multiplicative complexities, J. Assoc. Comput. Mach., 24, 311-331 (1977) · Zbl 0382.68045
[8] Gastinel, N., Le rang tensoriel d’un ensemble de matrices, Seminaire d’Analyse Numerique de l’Universite de Grenoble (1972), No. 159
[9] Lafon, J. C., Optimum computation of \(p\) bilinear forms, Linear Algebra and Appl., 10, 225-260 (1975) · Zbl 0309.15015
[10] Strassen, V., Vermeidung von Divisionen, J. Reine Angew. Math., 264, 184-202 (1973) · Zbl 0294.65021
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.