Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
110
Voted
STACS
2001
Springer
112
views
Theoretical Computer Science
»
more
STACS 2001
»
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
15 years 7 months ago
Download
ls2-www.cs.uni-dortmund.de
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
claim paper
Read More »