1 Answers
In the computational complexity theory of counting problems, a polynomial-time counting reduction is a type of reduction used to define the notion of completeness for the complexity class ♯P. These reductions may also be called polynomial many-one counting reductions or weakly parsimonious reductions; they are analogous to many-one reductions for decision problems and they generalize the parsimonious reductions.
4 views
Answered