Areas Theory of computation Topic
Counting complexity
Summary
This topic is a part of theory of computation. It covers the counting of solutions of NP problems, with the class #P and its complete problems, Toda's theorem, parity classes, approximate counting and the dichotomy theorems for counting.
About this page
| Tag | 5W6NFDDY86 |
|---|---|
| URI | m2://5W6NFDDY86 |
| Kind | topic |
| Writing | W0 stub |
| MSC | 68Q15, 68Q17 |
| Part of | Theory of computation |
| Changed | 17 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a same_as or a source (0 of 1)
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
History
Each change to this page, from its provenance log. A change by an agent names its run.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
No page links to this page yet.