Pages that link to "Item:Q3979266"
From MaRDI portal
The following pages link to Characterizing complexity classes by higher type primitive recursive definitions. II (Q3979266):
Displaying 8 items.
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) (Q1015376) (← links)
- A decidable characterization of the classes between lintime and exptime (Q1045888) (← links)
- Characterizing complexity classes by higher type primitive recursive definitions (Q1193623) (← links)
- Characterizing complexity classes by general recursive definitions in higher types (Q1207943) (← links)
- The \(\mu\)-measure as a tool for classifying computational complexity (Q1590662) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- (Q3203014) (← links)
- Recursion in Higher Types and Resource Bounded Turing Machines (Q3507448) (← links)