Counting Complexity Classes is a theoretical framework in computational complexity theory that consists of complexity classes defined by the number of accepting computation paths of nondeterministic Turing machines, distinguishing it from decision-based complexity classes by focusing on counting solutions rather than deciding language membership.
110
Publications
5K
Citations
168
Authors
121
Institutions
Publications per year
2017–2026
7
Publications
110
A comparative classification of complexity measures
Renate Wackerbauer, A. Witt, Harald Atmanspacher et al. · Chaos Solitons & Fractals · 1994 · 265 citations
The Parameterized Complexity of Counting Problems
Jörg Flum, Martin Grohe · SIAM Journal on Computing · 2004 · 242 citations
The complexity of approximate counting
Larry Stockmeyer · 1983 · 209 citations · Full text
1–5 of 110
Authors
168
- PL
6
h-index
- JC
6
h-index
- MX
5
h-index
- HV
5
h-index
- KW
4
h-index
1–5 of 168
Institutions
121
University of Würzburg
Würzburg, Germany
6 h-index
10 publications
202 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
5 h-index
5 publications
329 citations
Paderborn University
Paderborn, Germany
4 h-index
5 publications
120 citations
University of Leeds
Leeds, United Kingdom
4 h-index
5 publications
219 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
4 h-index
6 publications
251 citations
Université Paris Cité
Paris, France
4 h-index
4 publications
123 citations
Centre National de la Recherche Scientifique
Paris, France
3 h-index
3 publications
42 citations
Institute of Software
Beijing, China
3 h-index
4 publications
65 citations
1–8 of 121
Venues
- Theoretical Computer Science
11 publications · 563 citations
11
h-index
- Journal of Computer and System Sciences
8 publications · 245 citations
8
h-index
- SIAM Journal on Computing
8 publications · 634 citations
8
h-index
- Theory of Computing Systems
4 publications · 126 citations
4
h-index
- Information and Computation
3 publications · 54 citations
3
h-index
1–5