Ramified recurrence and computational complexity II: Substitution and poly-space
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 486-500
- https://doi.org/10.1007/bfb0022277
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Functional characterizations of uniform log-depth and polylog-depth circuit familiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Characterizing complexity classes by higher type primitive recursive definitionsTheoretical Computer Science, 1992
- Datalog extensions for database queries and updatesJournal of Computer and System Sciences, 1991
- Non-deterministic languages to express deterministic transformationsPublished by Association for Computing Machinery (ACM) ,1990
- Fixed-point extensions of first-order logicAnnals of Pure and Applied Logic, 1986
- Relational queries computable in polynomial timeInformation and Control, 1986
- Algebras of feasible functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,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