A read-once branching program lower bound of Ω(2 <sup>n/4</sup> ) for integer multiplication using universal hashing (Q5175997)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A read-once branching program lower bound of Ω(2 n/4 ) for integer multiplication using universal hashing |
scientific article; zbMATH DE number 6409738
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A read-once branching program lower bound of Ω(2 <sup>n/4</sup> ) for integer multiplication using universal hashing |
scientific article; zbMATH DE number 6409738 |
Statements
A read-once branching program lower bound of Ω(2 <sup>n/4</sup> ) for integer multiplication using universal hashing (English)
0 references
27 February 2015
0 references
computational complexity
0 references
integer multiplication
0 references
lower bounds
0 references
read-once branching programs
0 references
