Abstract
Tight bounds are proved for Sort, Merge, Insert, Gcd of integers, Gcd of polynomials, and Rational functions over a finite inputs domain, in a random access machine with arithmetic operations, direct and indirect addressing, unlimited power for answering YES/NO questions, branching, and tables with bounded size. These bounds are also true even if additions, subtractions, multiplications, and divisions of elements by elements of the field are not counted.
In a random access machine with finitely many constants and a bounded number of types of instructions, it is proved that the complexity of a function over a countable infinite domain is equal to the complexity of the function in a sufficiently large finite subdomain.
- 1 ~AHO, A. A., HOPCROFT, J. E., AND ULLMAN, J. D. The Design and Analysis of Computer ~Algorithms. Addison-Wesley, Reading, Mass., 1974. Google Scholar
- 2 ~BEN-OR, M. Lower bound for algebraic computation trees. In Proceedings of the 15th Annual ~ACM Symposium on the Theory of Computing (Boston, Mass., Apr. 25-27). ACM, New York, ~1983, pp. 80-86. Google Scholar
- 3 ~BSHOUTY, N.H. Euclid's GCD algorithm is not optimal. I. Upper bounds. In preparation.Google Scholar
- 4 ~BSHOUTY, N.H. Euclid's GCD algorithm is not optimal, II. Lower bounds. In preparation.Google Scholar
- 5 ~FRIEDMAN, N. Some results on the effect of arithmetics on comparison problems. In ~Proceedings of the 13th IEEE Symposium on Switching and Automata Theory. IEEE, New York, ~1972, pp. 139-143.Google Scholar
- 6 ~HONG, J. On lower bounds of time complexity of some algorithms. Scienna Sinica 22 (1979), ~890-900.Google Scholar
- 7 ~KAMINSKI, M., AND BSHOUTY, N.H. Multiplicative complexity of polynomial multiplication ~over finite field. In Proceedmgs of the 28th Amzual Symposium on Foundations of Computer ~Science. IEEE, New York, 1987.Google Scholar
- 8 ~MANSOUR, Y., SCHIEBER, B., AND TIWARI, P. Lower bounds for greatest common divisor ~computation. In Proceedings of the 29th 1EEE Symposium on Foundations of Computer Science ~(Oct.), IEEE, New York, 1988, pp. 54-63,Google Scholar
- 9 ~MEYER AUF DER HEIDE, F. Lower bounds for solving linear Diophantine equations on ~random access machines. J. ACM 32 4 (Oct. 1985), 929-937~ Google Scholar
- 10 ~MORAN, S., SNIR, M. AND MANBER, U. Applications of Ramsey's theorem to decision tree ~complexity. J. ACM 32, 4 (Oct. 1985), 938 949. Google Scholar
- 11 ~PAUL, W., AND SIMON, J. Decision trees and random access machines. In Monographie 30, ~L'Enseignement Mathematique, Logic and Algorithmic--An International Symposmm Held in ~Honor of Ernst Specker. Univ. Geneva Press, Geneva, Switzerland, 1982, pp. 331-340~Google Scholar
- 12 ~SCHWARTZ, J. T. Fast probabilistic algorithms for verification of polynomial identities. J. ~ACM 27, 4 (Oct. 1980), 704-717. Google Scholar
- 13 ~STRASSEN, g. Die Berechnungskomplexitat von elementarsymmetrischen funktionen und ~von Interpolationskoeffizienten. Numer. Math 20 (1973), 238-251.Google Scholar
- 14 ~YAO, A. Lower bounds for algebraic computation trees with integer inputs. In Proceedings of ~the 30th IEEE Symposium on Foundations of Computer Science, IEEE, New York, 1989.Google Scholar
Index Terms
On the complexity of functions for random access machines
Recommendations
On the Conversion of Hensel Codes to Farey Rationals
Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The first algorithm is based on the trial and error factorization of the weight of a Hensel code, inversion and range test. The second algorithm is ...
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
SFCS '88: Proceedings of the 29th Annual Symposium on Foundations of Computer ScienceAlgorithms are developed that adopt a novel implicit representation for multivariate polynomials and rational functions with rational coefficients, that of black boxes for their evaluation. It is shown that within this evaluation-box representation, the ...
Factorization properties of chebyshev polynomials
Several factorization properties of Chebyshev are reported here. Studying the euclidean division of two Chebyshev, we observe that the remainder is either zero or (up to a sign) another Chebyshev polynomial. This lead to explicit computation of the ...






Comments