On the additions necessary to compute certain functions

Authors:
David Kirkpatrick
Affiliations:
-
Venue:
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Year:
1972

Citing 3
Cited 1

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Some results concerning efficient and optimal algorithms

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Fast matrix multiplication

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Invariant and geometric aspects of algebraic complexity theory I

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a theoretical notion, strongly related to algebraic independence, which can be applied to the terms of any computable expression to derive a lower bound on the number of additions and subtractions required to compute that expression.