Complexity bounds on program realizations of Boolean functions specified in various forms (Q1101067)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4045653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity bounds on program realizations of Boolean functions specified in various forms |
scientific article; zbMATH DE number 4045653 |
Statements
Complexity bounds on program realizations of Boolean functions specified in various forms (English)
0 references
1987
0 references
We examine the complexity bounds on binary, k-ary, and matrix programs which represent Boolean functions specified in various forms.
0 references
binary programs
0 references
complexity bounds
0 references
matrix programs
0 references
Boolean functions
0 references
