On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication (Q5375393)
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 6936987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication |
scientific article; zbMATH DE number 6936987 |
Statements
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication (English)
0 references
14 September 2018
0 references
