What would be the consequence and meaning of existence of polynomial reduction of #P-complete problem into NP problem (not NP-complete problem)?
reducing #P-complete problem to NP problem
2
$\begingroup$
computational-complexity
-
0@sdcvvc D'oh, good catch - I'm not sure where I got the equality from. Though I think my conclusion still holds, regardless. – 2012-10-16