Approximation and complexity of functions on the integers

DOI10.1016/S0020-0255(71)80023-3MaRDI QIDQ2542988zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1971

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0255(71)80023-3

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Approximation and complexity of functions on the integers
• Approximation of functions on the integers
• Fuzzy sets
• scientific article; zbMATH DE number 3449756 (Why is no real title available?)
• scientific article; zbMATH DE number 3247155 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Participation measures

Cited in

(4)

• A model for iterative computation
• Approximation and complexity of functions on the integers
• Participation measures
• A note on comparison of subrecursive hierarchies

This page was built for publication: Approximation and complexity of functions on the integers

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