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

Authors

187

  1. JC
    Jin‐Yi Cai

    University of Wisconsin–Madison, United States

    11 publications · 450 citations

    10

    h-index

  2. AD
    Arnaud Durand

    Université Paris Cité, France

    6 publications · 165 citations

    6

    h-index

  3. LA
    Leslie Ann Goldberg

    University of Warwick, United Kingdom

    6 publications · 362 citations

    6

    h-index

  4. PL
    Pinyan Lu

    Microsoft Research Asia (China), China

    5 publications · 255 citations

    5

    h-index

  5. MH
    Miki Hermann

    Centre National de la Recherche Scientifique, France

    5 publications · 135 citations

    5

    h-index

1–5 of 187

Venues

  1. Theoretical Computer Science

    7 publications · 329 citations

    7

    h-index

  2. Journal of Computer and System Sciences

    6 publications · 134 citations

    6

    h-index

  3. SIAM Journal on Computing

    6 publications · 850 citations

    6

    h-index

  4. Journal of the ACM

    JACM · 4 publications · 286 citations

    4

    h-index

  5. arXiv (Cornell University)

    Repository · 4 publications · 44 citations

    4

    h-index

1–5