Some Exact Complexity Results for Straight-Line Computations over Semirings
Authors:
Open Access
- 1 July 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 29 (3) , 874-897
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 K~V wol~os AND prmASES artthmeuc complexity, convexity theory, Farkas Lemma, minimax algebra, straight-hne algorithmKeywords
This publication has 12 references indexed in Scilit:
- A counterexample to a conjecture of Schnorr referring to monotone networksTheoretical Computer Science, 1979
- Switching functions whose monotone complexity is nearly quadraticTheoretical Computer Science, 1979
- The complexity of computing the permanentTheoretical Computer Science, 1979
- A lower bound on the number of additions in monotone computationsTheoretical Computer Science, 1976
- Monotone switching circuits and boolean matrix productComputing, 1976
- Computer Search for Numerical InstabilityJournal of the ACM, 1975
- The Power of Negative Thinking in Multiplying Boolean MatricesSIAM Journal on Computing, 1975
- Complexity of monotone networks for Boolean matrix productTheoretical Computer Science, 1975
- Complexity measures for regular expressions1974
- Berechnung und Programm. IIActa Informatica, 1973