On the OBDD Complexity of the Most Significant Bit of Integer Multiplication (Q3502656)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the OBDD Complexity of the Most Significant Bit of Integer Multiplication |
scientific article |
Statements
On the OBDD Complexity of the Most Significant Bit of Integer Multiplication (English)
0 references
27 May 2008
0 references
computational complexity
0 references
integer multiplication
0 references
lower bounds
0 references
ordered binary decision diagrams
0 references
0 references
0 references
0 references
0 references
0 references
0 references
