skip to main content
article
Free Access

On the complexity of functions for random access machines

Published:01 April 1993Publication History
Skip Abstract Section

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.

References

  1. 1 ~AHO, A. A., HOPCROFT, J. E., AND ULLMAN, J. D. The Design and Analysis of Computer ~Algorithms. Addison-Wesley, Reading, Mass., 1974. Google ScholarGoogle Scholar
  2. 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 ScholarGoogle Scholar
  3. 3 ~BSHOUTY, N.H. Euclid's GCD algorithm is not optimal. I. Upper bounds. In preparation.Google ScholarGoogle Scholar
  4. 4 ~BSHOUTY, N.H. Euclid's GCD algorithm is not optimal, II. Lower bounds. In preparation.Google ScholarGoogle Scholar
  5. 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 ScholarGoogle Scholar
  6. 6 ~HONG, J. On lower bounds of time complexity of some algorithms. Scienna Sinica 22 (1979), ~890-900.Google ScholarGoogle Scholar
  7. 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 ScholarGoogle Scholar
  8. 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 ScholarGoogle Scholar
  9. 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 ScholarGoogle Scholar
  10. 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 ScholarGoogle Scholar
  11. 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 ScholarGoogle Scholar
  12. 12 ~SCHWARTZ, J. T. Fast probabilistic algorithms for verification of polynomial identities. J. ~ACM 27, 4 (Oct. 1980), 704-717. Google ScholarGoogle Scholar
  13. 13 ~STRASSEN, g. Die Berechnungskomplexitat von elementarsymmetrischen funktionen und ~von Interpolationskoeffizienten. Numer. Math 20 (1973), 238-251.Google ScholarGoogle Scholar
  14. 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 ScholarGoogle Scholar

Index Terms

  1. On the complexity of functions for random access machines

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!