A complexity measure for data flow models

DOI10.1007/BF00996925MaRDI QIDQ3735082zbMATH OpenOpenAlexFDO

Authors Howard E. Motteler, Carl H. Smith

Publication date 1985

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00996925

zbMATH Keywords

abstract complexity theoryBlum complexity measuredata flow computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3872641
• scientific article; zbMATH DE number 3913694
• Evaluation of different structures of dataflow computers
• On the complexity of dataflow analysis of logic programs
• scientific article; zbMATH DE number 3924114

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computational Complexity and the Existence of Complexity Gaps
• Gödel numberings of partial recursive functions
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)

This page was built for publication: A complexity measure for data flow models

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