Affiliation:
1. Univ. of Calgary, Calgary, Alberta, Canada
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference14 articles.
1. ~BSHOUTY N.H. Euclid's GCD algorithm is not optimal. I. Upper bounds. In preparation. ~BSHOUTY N.H. Euclid's GCD algorithm is not optimal. I. Upper bounds. In preparation.
2. ~BSHOUTY N.H. Euclid's GCD algorithm is not optimal II. Lower bounds. In preparation. ~BSHOUTY N.H. Euclid's GCD algorithm is not optimal II. Lower bounds. In preparation.
3. ~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. ~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.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献