A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication (Q3557025): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:41, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication |
scientific article |
Statements
A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication (English)
0 references
27 April 2010
0 references
