A complexity measure for data flow models

DOI10.1007/BF00996925zbMath0599.68044OpenAlexW1974007871MaRDI QIDQ3735082

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)

Cites Work

• Unnamed Item
• Gödel numberings of partial recursive functions
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computational Complexity and the Existence of Complexity Gaps

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