ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Bi-decomposing large Boolean functions via interpolation and satisfiability solving

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Ruei-Rung Lee National Taiwan University, Taipei, Taiwan
Jie-Hong R. Jiang National Taiwan University, Taipei, Taiwan
Wei-Lun Hung National Taiwan University, Taipei, Taiwan
Published in:
· Proceeding
DAC '08 Proceedings of the 45th annual Design Automation Conference
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-115-6 doi>10.1145/1391469.1391634
Bi-decomposing large Boolean functions via interpolation and satisfiability solving Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 19
· Citation Count: 6


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 © 2012 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