SIGN IN
SIGN UP
Formula Caching in DPLL
Full Text:
PDF
Buy this Article
Authors:
Paul Beame
University of Washington
Russell Impagliazzo
University of California, San Diego
Toniann Pitassi
University of Toronto
Nathan Segerlind
Intel Corporation
2010 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 35
· Downloads (cumulative): 245
· Citation Count: 1
Published in:
· Journal
ACM Transactions on Computation Theory (TOCT)
TOCT Homepage
archive
Volume 1 Issue 3, March 2010
Article No. 9
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1714450.1714452
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
backtracking
complexity of proof procedures
proof complexity
resolution
resolution
satisfiability
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