Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby. The Complexity of Approximating Bounded-Degree Boolean #CSP. In Jean-Yves Marion, Thomas Schwentick, editors, 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France. Volume 5 of LIPIcs, pages 323-334, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010. [doi]
Abstract is missing.