Abstract
We study the parameterized complexity of the propositional satisfiability (SAT) and the more general model counting (#SAT) problems and obtain novel f......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
