A complexity measure for data flow models
type: Item
instance of: scholarly article
title: A complexity measure for data flow models
zbMATH Open document ID: 0599.68044
DOI: 10.1007/BF00996925
author: Howard E. Motteler
author: Carl H. Smith
published in: International Journal of Computer & Information Sciences
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3967919
zbMATH Keywords: Blum complexity measure
zbMATH Keywords: abstract complexity theory
zbMATH Keywords: data flow computations
MaRDI profile type: MaRDI publication profile
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: Q4153600
cites work: Gödel numberings of partial recursive functions
cites work: Computational Complexity and the Existence of Complexity Gaps
full work available at URL: https://doi.org/10.1007/bf00996925
OpenAlex ID: W1974007871
Recommended article: Q3339246
Recommended article: Q3690236
Recommended article: Evaluation of different structures of dataflow computers
Recommended article: On the complexity of dataflow analysis of logic programs
Recommended article: Q3698290
description: scientific article; zbMATH DE number 3967919