A larger lower bound on the OBDD complexity of the most significant bit of multiplication (Q3557025)
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 5702157
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A larger lower bound on the OBDD complexity of the most significant bit of multiplication |
scientific article; zbMATH DE number 5702157 |
Statements
A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication (English)
0 references
27 April 2010
0 references
0.9058390855789183
0 references
0.9044621586799622
0 references
0.9001699090003967
0 references
0.8983933925628662
0 references
0.8900625705718994
0 references
