On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication (Q3417010)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication |
scientific article |
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
