SIGN IN
SIGN UP
Using reconfigurable computing techniques to accelerate problems in the CAD domain: a case study with Boolean satisfiability
Full Text:
PDF
Buy this Article
Authors:
Peixin Zhong
Princeton University and NEC CCRL
Pranav Ashar
Princeton University and NEC CCRL
Sharad Malik
Princeton University and NEC CCRL
Margaret Martonosi
Princeton University and NEC CCRL
1998 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 5
· Downloads (cumulative): 174
· Citation Count: 12
Published in:
· Proceeding
DAC '98 Proceedings of the 35th annual Design Automation Conference
Pages 194-199
ACM
New York, NY
, USA
©1998
table of contents
ISBN:0-89791-964-5
doi>
10.1145/277044.277098
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithm design and analysis
algorithms
complexity of proof procedures
design
emulation, functional simulation, reconstruction, visibility
gate arrays
measurement
performance
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder