Following the approach of Hemaspaandra and Vollmer, we can define counting complexity classes #.C for any complexity class C of decision problems. In particular, the classes #.Pi_{k}P with k >= 1 corresponding to all levels of the polynomial hierarchy have thus been studied. However, for a large variety of counting ... more >>>