Using lower bounds during dynamic BDD minimization

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Rolf Drechsler Institute of Computer Science, Albert-Ludwigs-University, 79110 Freiburg im Breisgau, Germany
Wolfgang Günther Institute of Computer Science, Albert-Ludwigs-University, 79110 Freiburg im Breisgau, Germany
Published in:
Cover Image
 
· Proceeding
DAC '99 Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Pages 29-32
ACM New York, NY, USA ©1999
table of contents ISBN:1-58113-109-7 doi>10.1145/309847.309858
Using lower bounds during dynamic BDD minimization Published by ACM 1999 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 5
· Downloads (cumulative): 391
· Citation Count: 8


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder