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
-
4You have to be substantially more specific about what you mean by 'polynomial reduction' because #P problems aren't decision problems, so the usual notions of 'reduction' don't directly apply. Given that $P^{\#P}=PH$, though (for a suitable definition of $P^{\#P}$), it seems like one natural consequence of such a reduction would be the collapse of the polynomial hierarchy to at most $\Sigma_2$ ($=P^{NP}$). – 2012-07-11
-
1@Steven: $P^{\# P} \supseteq PH$ but equality is not known. – 2012-10-16
-
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