A note on a counting problem arising in percolation theory (Q685697)

Given a graph \(G= (V,E)\) and two vertices \(u\) and \(v\), let \(\psi(G;u,v)= \sum_ f \Pi_ e f(e)\), where the sum is over all functions \(f: E\to \{-1,1\}\) such that there exists a simple path from \(u\) to \(v\) with the property that \(f\) assigns \(+1\) to each edge along the path, and the product is over all edges \(e\) of \(G\). It is shown that the problem of computing \(\psi(G;u,v)\) is \(\#P\)-complete.