On the Complexity of Functions for Random Access Machines

@article{Bshouty1993OnTC,
  title={On the Complexity of Functions for Random Access Machines},
  author={Nader H. Bshouty},
  journal={J. ACM},
  year={1993},
  volume={40},
  pages={211-223}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
1 Citations
0 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…