All Algebraic Functions Can Be Computed Fast
Journal of the ACM (JACM)
Fast Algorithms for Manipulating Formal Power Series
Journal of the ACM (JACM)
Complexity of Sequential and Parallel Numerical Algorithms
Complexity of Sequential and Parallel Numerical Algorithms
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The effect of algebraic structure on the computational complexity of matrix multiplication
The effect of algebraic structure on the computational complexity of matrix multiplication
A New Algorithm for Inner Product
IEEE Transactions on Computers
Fast modular transforms via division
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
| Hi-index | 0.00 |
Algebraic complexity theory, the study of the minimum number of operations sufficient to perform algebraic computations, is surveyed with emphasis on the general theory of bilinear forms and two of its applications: polynomial multiplication and matrix multiplication. Though by no means exhausting algebraic complexity theory, these topics illustrate well its development and its methods, and provide examples of its most striking successes.