> But the calculation in this case is a ‘#P-hard problem’, which is even harder than notoriously tricky NP-hard problems Maybe someone can help me here. Wikipe

> But the calculation in this case is a ‘#P-hard problem’, which is even harder than notoriously tricky NP-hard problems Maybe someone can help me here. Wikipedia [1] states this about #P -complete problems: "A polynomial-time algorithm for solving a #P-complete problem, if it existed, would solve the P versus NP problem by implying that P and NP are equal." So, would the statement of the article imply that P=NP? That would be quite a big deal, wouldn't it? Now, the statement talks about #P-hard, wikipedia about #P-complete. Does this make a difference? [1] https://en.wikipedia.org/wiki/%E2%99%AFP-complete https://en.wikipedia.org/wiki/%E2%99%AFP-complete