Complexity dichotomies of counting problems
From MaRDI portal
Exact enumeration problems, generating functions (05A15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)
Recommendations
- Complexity dichotomy for counting problems
- The complexity of counting problems
- scientific article; zbMATH DE number 4064488
- scientific article; zbMATH DE number 1072530
- scientific article; zbMATH DE number 850077
- Counting problems in parameterized complexity
- Progress in complexity of counting problems
- The Parameterized Complexity of Counting Problems
- scientific article; zbMATH DE number 4072941
- Complexity Dichotomies for Counting Problems
Cited in
(8)- Counting Value Sets: Algorithm and Complexity
- Progress in complexity of counting problems
- The Parameterized Complexity of Counting Problems
- scientific article; zbMATH DE number 850077 (Why is no real title available?)
- Complexity dichotomy for counting problems
- scientific article; zbMATH DE number 7075922 (Why is no real title available?)
- Holant problems and counting CSP
- Where Tutte and Holant meet: a view from counting complexity
This page was built for publication: Complexity dichotomies of counting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900316)
