Abstract
The problem of computing polynomials in certain semmngs is considered. Precise bounds are obtained on the number of multiplications required by straight-hne algorithms which compute such functions as iterated matrix multiplication, iterated convolution, and permanent Usmg these bounds, tt is shown that the use of branching can exponentially speed up computations using the min, + operations, and that subtraction can exponentially speed up arithmetic computations These results can be interpreted as denying the existence of fast “universal” algorithms for computing certain polynomials.
Original language | English (US) |
---|---|
Pages (from-to) | 874-897 |
Number of pages | 24 |
Journal | Journal of the ACM (JACM) |
Volume | 29 |
Issue number | 3 |
DOIs | |
State | Published - Jul 1 1982 |
Externally published | Yes |
Keywords
- Farkas Lemma
- artthmeuc complexity
- convexity theory
- minimax algebra
- straight-hne algorithm
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Information Systems
- Hardware and Architecture
- Artificial Intelligence