Wahlström, Magnus Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Wahlström, M. (2008). A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. In M. Grohe, & R. Niedermeier (Eds.), Parameterized and Exact Computation (pp. 202-213). Berlin: Springer. doi:10.1007/978-3-540-79723-4_19.