On time-space classes and their relation to the theory of real addition
Open Access
- 1 May 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 11 (1) , 59-69
- https://doi.org/10.1016/0304-3975(80)90036-5
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The complexity of logical theoriesTheoretical Computer Science, 1980
- The Computational Complexity of Logical TheoriesLecture Notes in Mathematics, 1979
- Separating Nondeterministic Time Complexity ClassesJournal of the ACM, 1978
- Techniques for separating space complexity classesJournal of Computer and System Sciences, 1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Big Omicron and big Omega and big ThetaACM SIGACT News, 1976
- A Decision Procedure for the First Order Theory of Real Addition with OrderSIAM Journal on Computing, 1975
- On restricted turing computabilityTheory of Computing Systems, 1971