Study of the complexity of an algorithm to derive the complement of a binary function (Q3352504)
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 4203723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Study of the complexity of an algorithm to derive the complement of a binary function |
scientific article; zbMATH DE number 4203723 |
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
0.8146457672119141
0 references
