Counting Complexity
Counting Complexity is a branch of computational complexity theory that classifies computational problems based on the difficulty of counting the number of solutions to decision problems in NP, rather than determining the existence of such solutions.
121
Publications
5.4K
Citations
187
Authors
120
Institutions
Publications per year
2017–2026
12
121
The Complexity of Counting in Sparse, Regular, and Planar Graphs
Salil Vadhan · SIAM Journal on Computing · 2001 · 260 citations · Full text
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
The Relative Complexity of Approximate Counting Problems
Martin Dyer, Leslie Ann Goldberg, Catherine Greenhill et al. · Algorithmica · 2003 · 208 citations
1–5 of 121
187
10
h-index
6
h-index
6
h-index
5
h-index
5
h-index
1–5 of 187
120
University of Wisconsin–Madison
Madison, United States
10 h-index
16 publications
497 citations
Université Paris Cité
Paris, France
9 h-index
9 publications
283 citations

Centre National de la Recherche Scientifique
Paris, France
8 h-index
13 publications
205 citations
Queen Mary University of London
London, United Kingdom
6 h-index
6 publications
98 citations

University of Leeds
Leeds, United Kingdom
6 h-index
7 publications
460 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
8 publications
341 citations
University of Oxford
Oxford, United Kingdom
6 h-index
10 publications
295 citations

Lund University
Lund, Sweden
5 h-index
10 publications
362 citations
1–8 of 120
7 publications · 329 citations
7
h-index
6 publications · 134 citations
6
h-index
6 publications · 850 citations
6
h-index
JACM · 4 publications · 286 citations
4
h-index
Repository · 4 publications · 44 citations
4
h-index
1–5