On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication (Q3417010)
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 5103801
| 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 5103801 |
Statements
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication (English)
0 references
9 January 2007
0 references
lower bounds
0 references
complexity
0 references
VLSI implementations
0 references
graph representations
0 references
Boolean functions
0 references
integer multiplication
0 references
chip area
0 references
speed
0 references
ordered binary decision diagram
0 references
data structure
0 references
area-time complexity
0 references
computational complexity
0 references
digital arithmetic
0 references
0.8422960638999939
0 references
0.8342823386192322
0 references
0.8259056806564331
0 references
0.8197725415229797
0 references
