Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (Q3075511)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size |
scientific article |
Statements
Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (English)
0 references
15 February 2011
0 references
computational complexity
0 references
integer multiplication
0 references
lower bounds
0 references
ordered binary decision diagrams
0 references
randomized one-round communication complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
