“CountingComplexityClass”的概念、定义、习题解题方法及翻译-数学辞典

单词	CountingComplexityClass
释义	counting complexity class If $\\mathcal{NC}$ is a complexity class associated with non-deterministic machines then $\\mathcal{\\#C}=\\{\\#R\\mid R\\in\\mathcal{NC}\\}$ is the set of counting problems associated with each search problem in $\\mathcal{NC}$ . In particular, $\\mathcal{\\#P}$ is the class of counting problems associated with $\\mathcal{NP}$ search problems.
随便看	ProductOfInjectiveModulesIsInjective product of injective modules is injective ProductOfLeftAndRightIdeal product of left and right ideal ProductOfMetricSpaces product of metric spaces ProductOfNegativeNumbers product of negative numbers ProductOfNonemptySetOfNonemptySetsIsNonempty product of non-empty set of non-empty sets is non-empty ProductOfPathConnectedSpacesIsPathConnected product of path connected spaces is path connected ProductOfPosets product of posets ProductOfUniformSpaces product of uniform spaces ProductRepresentationsOfJacobivarthetaFunctions product representations of Jacobi ϑ functions ProductRule product rule Productsigmaalgebra ProductsOfCompactPavingsAreCompact products of compact pavings are compact ProductsOfConnectedSpacesAreConnected products of connected spaces are connected

数学辞典收录了18232条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。

counting complexity class