Optimal length tree-like resolution refutations for 2SAT formulas

Full Text: PdfPdf Buy this ArticleBuy this Article
Author: K. Subramani LDCSEE, West Virginia University, Morgantown, WV
Published in:
· Journal
ACM Transactions on Computational Logic (TOCL) TOCL Homepage archive
Volume 5 Issue 2, April 2004
Pages 316 - 320
ACM New York, NY, USA
table of contents doi>10.1145/976706.976711
Optimal length tree-like resolution refutations for 2SAT formulas Published by ACM 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 13
· Downloads (cumulative): 202
· Citation Count: 2


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