Can anyone give a polynomial reduction from computing the permanent of a matrix into counting the satisfying assignments for a 2SAT problem?



#P Complexity Question
See [The Complexity of Enumeration and Reliability Problems](http://dx.doi.org/10.1137/0208032), by Valiant. This is Problem number 7 in Valiant's list.


