# counting complexity class

If $\mathcal{N}\mathcal{C}$ is a complexity class^{} associated with non-deterministic machines then $\mathrm{\#}\mathcal{C}=\{\mathrm{\#}R\mid R\in \mathcal{N}\mathcal{C}\}$ is the set of counting problems associated with each search problem in $\mathcal{N}\mathcal{C}$. In particular, $\mathrm{\#}\mathcal{P}$ is the class of counting problems associated with $\mathcal{N}\mathcal{P}$ search problems.

Title | counting complexity class |
---|---|

Canonical name | CountingComplexityClass |

Date of creation | 2013-03-22 13:02:31 |

Last modified on | 2013-03-22 13:02:31 |

Owner | Henry (455) |

Last modified by | Henry (455) |

Numerical id | 4 |

Author | Henry (455) |

Entry type | Definition |

Classification | msc 68Q15 |