Size-time complexity of Boolean networks for prefix computations (Q4729343)
From MaRDI portal
scientific article; zbMATH DE number 4113995
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Size-time complexity of Boolean networks for prefix computations |
scientific article; zbMATH DE number 4113995 |
Statements
Size-time complexity of Boolean networks for prefix computations (English)
0 references
1989
0 references
Boolean networks
0 references
prefix computations
0 references
computational complexity
0 references
models of computation
0 references
parallel computation
0 references
size-time trade-offs
0 references
