scientific article; zbMATH DE number 3995649

MaRDI QIDQ4723715zbMATH OpenFDO

Authors Maciej Liśkiewicz, Krzysztof Loryś, Marek Piotrów

Publication date 1986

zbMATH Keywords

complexity classeslimited recursion schemataTuring machines

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Recursion Schemata for NC k
• Tailoring recursion for complexity
• scientific article; zbMATH DE number 4134024
• scientific article; zbMATH DE number 2163035
• Recursion schemata for slowly growing depth circuit classes

Cited in

(9)

• A decidable characterization of the classes between lintime and exptime
• On a relation between uniform coding and problems of the form DTIMEF\((\mathcal F)=?\)DSPACEF\((\mathcal F)\)
• Recursion schemata for slowly growing depth circuit classes
• scientific article; zbMATH DE number 4134024 (Why is no real title available?)
• CRN elimination and substitution bases for complexity classes
• scientific article; zbMATH DE number 4179364 (Why is no real title available?)
• scientific article; zbMATH DE number 4108743 (Why is no real title available?)
• scientific article; zbMATH DE number 1507220 (Why is no real title available?)
• scientific article; zbMATH DE number 3895051 (Why is no real title available?)

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