函數問題Prentice Hall, 2008, ISBN 0132288060, section 28.10 "The problem classes FP and FNP", pp. 689-694 决策问题 搜索问题 计数问题(英语:Counting problem (complexity)) 最佳化问题
戶田定理在理論計算機科學的複雜度理論這一分支中,戶田定理是一個重要的結果,它指出在多項式譜系和計數問題(英语:Counting problem (complexity))之間的內在聯繫: P H ⊆ P # P . {\displaystyle PH\subseteq P^{\#P}.}
哥德尔奖doi:10.1145/1667053. Bulatov, Andrei A. The complexity of the counting constraint satisfaction problem. Journal of the ACM (Association for Computing
图自同构1016/0022-0000(82)90009-5. Mathon, R. (1979). "A note on the graph isomorphism counting problem". Information Processing Letters. 8: 131–132. doi:10.1016/0020-0190(79)90004-8
L (複雜度)Barak (2009) p. 88 Complexity Zoo: RL A. Borodin, S.A. Cook, P.W. Dymond, W.L. Ruzzo, and M. Tompa. Two applications of inductive counting for complementation