Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-14T08:01:47.516Z Has data issue: false hasContentIssue false
  • English
  • Français

On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines

Published online by Cambridge University Press:  12 March 2014

Wolfgang Maass
Wolfgang Maass*
Affiliation:
Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago, Illinois 60680
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove optimal lower bounds on the computation time for several well-known test problems on a quite realistic computational model: the random access machine. These lower bound arguments may be of special interest for logicians because they rely on finitary analogues of two important concepts from mathematical logic: inaccessible numbers and order indiscernibles.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 53 , Issue 4 , December 1988 , pp. 1098 - 1109
Copyright
Copyright © Association for Symbolic Logic 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1

Supported in part by NSF grant DCR-8504247.

References

REFERENCES

[1] Aho, A. V., Hopcroft, J. E. and Ullman, J. D., The design and analysis of computer algorithms, Addison-Wesley, Reading, Massachusetts, 1974.Google Scholar
[2] Alon, N. and Maass, W., Ramsey theory and lower bounds for branching programs, Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (1986), pp. 410–417.Google Scholar
[3] Ben-Or, M., Lower bounds for algebraic computation trees, Proceedings of the 15th ACM Symposium on Theory of Computing (1983), pp. 80–86.Google Scholar
[4] Chandra, A. K., Furst, M. L. and Lipton, R. J., Multi-party protocols, Proceedings of the 15th ACM Symposium on Theory of Computing (1983), pp. 94–99.Google Scholar
[5] Cook, S. A. and Reckhow, R. A., Time bounded random access machines, Journal of Computer and System Sciences, vol. 7 (1973), pp. 354–375.CrossRefGoogle Scholar
[6] Dietzfelbinger, M. and Maass, W., Two lower bound arguments with “inaccessible” numbers, Proceedings of the structure in complexity theory conference (1986), Lecture Notes in Computer Science, vol. 223, Springer-Verlag, Berlin, 1986, pp. 163–183.CrossRefGoogle Scholar
[7] Dietzfelbinger, M. and Maass, W., Three lower bound arguments with “inaccessible” numbers, to appear in a special issue of the Journal of Computer and System Sciences for the 1986 Structure in Complexity Theory conference.Google Scholar
[8] Dobkin, D. and Lipton, R., A lower bound of n 2/2 on linear search programs for the knapsack problem, Journal of Computer and System Sciences, vol. 16 (1975), pp. 417–442.Google Scholar
[9] Graham, R. L., Rothschild, B. L. and Spencer, J. H., Ramsey theory, Wiley, New York, 1980.Google Scholar
[10] Hartmanis, J. and Simon, J., On the power of multiplication in random access machines, Conference Record of the 15th IEEE Symposium on Switching and Automata Theory (1974), pp. 13–23.Google Scholar
[11] Hong, J., On lower bounds of time complexity of some algorithms, Scientia Sinica, vol. 22 (1979), pp. 890–900.Google Scholar
[12] Klein, P. and auf der Heide, F. Meyer, A lower time bound for the knapsack problem on random access machines, Acta Informatica, vol. 19 (1983), pp. 385–395.CrossRefGoogle Scholar
[13] Maass, W., An optimal quadratic lower bound for random access machines and other applications of Ramsey's theorem, Preliminary report, University of California, Berkeley, California, 1984.Google Scholar
[14] Maass, W., On the use of inaccessible numbers and order indiscernibles in lower bound arguments for random access machines, Research Report in Computer Science, no. 4, University of Illinois at Chicago, Chicago, Illinois, 1985.Google Scholar
[15] auf der Heide, F. Meyer and Reischuk, R., On the limits to speed up parallel machines by large hardware and unbounded communication, Proceedings of the 25th IEEE Symposium on Foundations of Computer Science (1984), pp. 56–84.Google Scholar
[16] auf der Heide, F.Meyer, Lower bounds for solving linear Diophantine equations on random access machines, Journal of the Association for Computing Machinery, vol. 32 (1985), pp. 929–937.CrossRefGoogle Scholar
[17] auf der Heide, F.Meyer and Wigderson, A., The complexity of parallel sorting, Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (1985), pp. 532–540.Google Scholar
[18] Moran, S., Snir, M. and Manber, U., Applications of Ramsey's theorem to decision tree complexity, Proceedings of the 25th IEEE Symposium on Foundations of Computer Science (1984), pp. 332–337.Google Scholar
[19] Moran, S., Snir, M. and Manber, U., Applications of Ramsey's theorem to decision tree complexity, Journal of the Association for Computing Machinery, vol. 32 (1985), pp. 938–949.CrossRefGoogle Scholar
[20] Paul, W. J. and Simon, J., Decision trees and random access machines, Logic and algorithmic (symposium in honor of Ernest Specker, Zürich, 1980), Monographies de L'Enseignement Mathématique, vol. 30, Université de Genève, Geneva, 1982, pp. 331–340.Google Scholar
[21] Pudlák, P., A lower bound on the complexity of branching programs, Mathematical foundations of computer science (proceedings, Prague, 1984), Lecture Notes in Computer Science, vol. 176, Springer-Verlag, Berlin, 1984, pp. 480–489.CrossRefGoogle Scholar
[22] Ramsey, F. P., On a problem of formal logic, Proceedings of the London Mathematical Society, ser. 2, vol. 30 (1930), pp. 264–286.CrossRefGoogle Scholar
[23] Sacks, G. E., Saturated model theory, Benjamin, Reading, Massachusetts, 1972.Google Scholar
[24] Yao, A. C., On the complexity of comparison problems using linear functions, Proceedings of the 16th IEEE Symposium on Foundations of Computer Science (1975), pp. 85–89.Google Scholar
[25] Yao, A. C., Should tables be sorted? Journal of the Association for Computing Machinery, vol. 28 (1981), pp. 615–628.CrossRefGoogle Scholar