SIGN IN
SIGN UP
Efficient SAT solving: beyond supercubes
Full Text:
PDF
Buy this Article
Authors:
Domagoj Babić
University of British Columbia
Jesse Bingham
University of British Columbia
Alan J. Hu
University of British Columbia
Published in:
· Proceeding
DAC '05
Proceedings of the 42nd annual Design Automation Conference
Pages 744-749
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-59593-058-2
doi>
10.1145/1065579.1065774
2005 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 22
· Downloads (cumulative): 217
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
DAC '13
Share:
|
Tags:
algorithms
computer-aided design
formal verification
graph and tree search strategies
learning
sat
search space pruning
verification
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