Completeness, approximability and exponential time results for counting problems with easy decision version (Q2143122)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completeness, approximability and exponential time results for counting problems with easy decision version |
scientific article |
Statements
Completeness, approximability and exponential time results for counting problems with easy decision version (English)
0 references
31 May 2022
0 references
computational complexity
0 references
counting complexity
0 references
\#P
0 references
\textsf{TotP}
0 references
tree-monotonicity
0 references
backtracking-tree estimation
0 references
0 references
0 references
