scientific article; zbMATH DE number 4037837

MaRDI QIDQ3778005zbMATH OpenFDO

Authors M. I. Kratko, Yu. V. Yatsishin

Publication date 1987

zbMATH Keywords

effective families of recursive functionsmachine-independent theory of computational complexity

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Abstract and axiomatic computability and recursion theory (03D75) Analysis of algorithms and problem complexity (68Q25)

Cited in

(8)

• Ordinal complexity of recursive definitions
• Computational complexity of functions
• scientific article; zbMATH DE number 1354146 (Why is no real title available?)
• scientific article; zbMATH DE number 1979755 (Why is no real title available?)
• scientific article; zbMATH DE number 2114136 (Why is no real title available?)
• Tailoring recursion for complexity
• scientific article; zbMATH DE number 3353266 (Why is no real title available?)
• Algorithms and Computation

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 Q3778005)