Number of quantifiers is better than number of tape cells
- 1 June 1981
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 22 (3) , 384-406
- https://doi.org/10.1016/0022-0000(81)90039-8
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Time Bounded Random Access Machines with Parallel ProcessingJournal of the ACM, 1979
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977
- On Time Versus SpaceJournal of the ACM, 1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Probabilities on finite modelsThe Journal of Symbolic Logic, 1976
- Maze recognizing automata and nondeterministic tape complexityJournal of Computer and System Sciences, 1973
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960