Sciweavers

STACS
2001
Springer
13 years 8 months ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel