|
ComputingReviews.com
|
Optimal length tree-like resolution refutations for 2SAT formulas Subramani K. ACM Transactions on Computational Logic5(2):316-320,2004.Type:Article |
|
|
|
Published By: ACM Press |
|
|
|
|
|
|
|
|
Use your personal or institutional subscription to read the fulltext of the article.
|
|
|
|
|
|
|
|
|
|
|
|