A characterization of the complexity of recursive predicates

MaRDI QIDQ2551103zbMATH OpenFDO

Authors R. I. Freidzon

Publication date 1972

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)

Cited in

(4)

• Ordinal complexity of recursive definitions
• Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents
• scientific article; zbMATH DE number 4179364 (Why is no real title available?)
• On the complexity of computation of rudimentary predicates

This page was built for publication: A characterization of the complexity of recursive predicates

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