On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
A characterization of the power of vector machines
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
On the complexity of RAM with various operation sets
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Straight-line program length as a parameter for complexity measures
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Upper bounds on the computational power of an optical model of computation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
We study complexity problems associated with generation and manipulation of integers. We show that many such questions may be formulated as problems about random access machines (RAMs), and recent results about RAMs with special instructions sets can be used to give estimates about the complexity of the manipulations. Finally we settle an open problem about RAMs (which becomes more interesting in this setting), namely the power of unrestricted vector machines, studied in [5] [6] [2]. We prove that allowing arbitrary shifts (instead of bounded shifts) gives at most a polynomial reduction in the time necessary to recognize languages by vector machines, thus solving the main problem left unanswered by the papers of Pratt and Stockmeyer [5], [6] and Hartmanis and Simon [2], [3]. Equivalently, it is possible to compare two integers, each obtained by a sequence of at most n operations of shift, sum, and boolean vector operations, within tape polynomial in n.