Some results on relativized deterministic and nondeterministic time hierarchies
- 1 February 1981
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 22 (1), 1-8
- https://doi.org/10.1016/0022-0000(81)90017-9
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979
- Separating Nondeterministic Time Complexity ClassesJournal of the ACM, 1978
- Relativized questions involving probabilistic algorithmsPublished by Association for Computing Machinery (ACM) ,1978
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- Relativization of the theory of computational complexityTransactions of the American Mathematical Society, 1976
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965