Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes

Authors:
Emanuele Covino;Giovanni Pani;Salvatore Caporaso
Affiliations:
-;-;-
Venue:
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Year:
2000

Citing 6
Cited 0

Stratified functional programs and computational complexity

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A new recursion-theoretic characterization of the polytime functions

Computational Complexity
Two-Tape Simulation of Multitape Turing Machines

Journal of the ACM (JACM)
A predicative and decidable charcterization of the polynomial classes of languages

Theoretical Computer Science
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy

CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

A resource-free characterization of some complexity classes is given by means of the predicative recursion and constructive diagonalization schemes, and of restrictions to substitution. Among other classes, we predicatively harmonize in the same hierarchy ptimef, the class Ɛ of the elementary functions, and classes DTIMESPACEF(np, nq).