Deterministic version of #P

14 Views Asked by At

#P is the complexity class concerned with counting the number of accepting paths of a non-deterministic Turing machine in polynomial time.

Is there a deterministic equivalent to this complexity class?