Addition requirements for matrix and transposed matrix products
Journal of Algorithms
Multilinear cayley factorization
Journal of Symbolic Computation
On the additions necessary to compute certain functions
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We expound new approaches to the analysis of algebraic complexity based on synthetic and algebraic geometry. The search for interesting lower bounds is a good reason to study the complexity of computation of linear forms. The analysis of linear algorithms leads naturally to questions about computational networks with their combinatorial aspects and about special configurations of sets of points in projective spaces which classical invariant theory might help to answer.