A note on the size of OBDDs for the graph of integer multiplication (Q975522)
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 5719234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the size of OBDDs for the graph of integer multiplication |
scientific article; zbMATH DE number 5719234 |
Statements
A note on the size of OBDDs for the graph of integer multiplication (English)
0 references
9 June 2010
0 references
computational complexity
0 references
integer multiplicaton
0 references
lower bounds
0 references
ordered binary decision diagrams
0 references
0 references
0 references
0 references
0.9189359545707704
0 references
0.9157027006149292
0 references
0.9149636626243592
0 references
0.9116543531417848
0 references
0.9006558656692505
0 references
