Study of the complexity of an algorithm to derive the complement of a binary function (Q3352504): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:47, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Study of the complexity of an algorithm to derive the complement of a binary function |
scientific article |
Statements
Study of the complexity of an algorithm to derive the complement of a binary function (English)
0 references
1989
0 references
complement of a binary function
0 references
combinational logic
0 references
programmable logic arrays
0 references
