Universal quantifiers and time complexity of random access machines
- 1 December 1985
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 18 (1) , 171-187
- https://doi.org/10.1007/bf01699468
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The Spectra of First-Order Sentences and Computational ComplexitySIAM Journal on Computing, 1984
- Languages which capture complexity classesPublished by Association for Computing Machinery (ACM) ,1983
- Upper and lower bounds for first order expressibilityJournal of Computer and System Sciences, 1982
- Number of quantifiers is better than number of tape cellsJournal of Computer and System Sciences, 1981
- AlternationJournal of the ACM, 1981
- Separating Nondeterministic Time Complexity ClassesJournal of the ACM, 1978
- A spectrum hierarchyMathematical Logic Quarterly, 1975
- Characterizations of time-bounded computations by limited primitive recursionPublished by Springer Nature ,1974
- A hierarchy for nondeterministic time complexityJournal of Computer and System Sciences, 1973
- Time bounded random access machinesJournal of Computer and System Sciences, 1973