Randomized OBDDs for the most significant bit of multiplication need exponential size
B Bollig, M Gillé - International Conference on Current Trends in Theory …, 2011 - Springer
Integer multiplication as one of the basic arithmetic functions has been in the focus of
several complexity theoretical investigations and ordered binary decision diagrams
(OBDDs) are one of the most common dynamic data structures for Boolean functions. Only
two years ago, the question whether the deterministic OBDD complexity of the most
significant bit of integer multiplication is exponential has been answered affirmatively. Since
probabilistic methods have turned out to be useful in almost all areas of computer science …
several complexity theoretical investigations and ordered binary decision diagrams
(OBDDs) are one of the most common dynamic data structures for Boolean functions. Only
two years ago, the question whether the deterministic OBDD complexity of the most
significant bit of integer multiplication is exponential has been answered affirmatively. Since
probabilistic methods have turned out to be useful in almost all areas of computer science …
Randomized OBDDs for the most significant bit of multiplication need exponential space
B Bollig, M Gillé - Information processing letters, 2011 - Elsevier
Integer multiplication as one of the basic arithmetic functions has been in the focus of
several complexity theoretical investigations and ordered binary decision diagrams
(OBDDs) are one of the most common dynamic data structures for Boolean functions. Only in
2008 the question whether the deterministic OBDD complexity of the most significant bit of
integer multiplication is exponential has been answered affirmatively. Since probabilistic
methods have turned out to be useful in almost all areas of computer science, one may ask …
several complexity theoretical investigations and ordered binary decision diagrams
(OBDDs) are one of the most common dynamic data structures for Boolean functions. Only in
2008 the question whether the deterministic OBDD complexity of the most significant bit of
integer multiplication is exponential has been answered affirmatively. Since probabilistic
methods have turned out to be useful in almost all areas of computer science, one may ask …
Showing the best results for this search. See all results
