scientific article; zbMATH DE number 4179364

zbMATH Open0716.03038MaRDI QIDQ3203014FDOQ3203014

Authors: Andreas Goerdt 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• Characterizing complexity classes by higher type primitive recursive definitions
• scientific article; zbMATH DE number 19768
• Characterizing complexity classes by general recursive definitions in higher types
• scientific article
• scientific article; zbMATH DE number 3995649
• The recursion-theoretic structure of complexity classes
• scientific article; zbMATH DE number 2163035
• scientific article; zbMATH DE number 4108743
• Higher type recursion, ramification and polynomial time
• A characterization of the complexity of recursive predicates

zbMATH Keywords

PSPACEPTIMEEXPTIMEHigher type primitive recursive definitionsGödel's system T

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Higher-type and set recursion theory (03D65)

Cited In (7)

• Title not available (Why is that?)
• Characterizing complexity classes by higher type primitive recursive definitions
• Title not available (Why is that?)
• Hereditarily-finite sets, data bases and polynomial-time computability
• Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus
• Computing on structures
• Characterizing complexity classes by general recursive definitions in higher types

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3203014)