Probabilistic Complexity Classes

Probabilistic Complexity Classes is a theoretical framework in computational complexity theory that categorizes decision problems based on the computational resources required by probabilistic Turing machines to solve them with bounded error probabilities.

172

Publications

14.3K

Citations

249

Authors

171

Institutions

Publications per year

2017–2026

14

Authors

249

  1. AD
    Adnan Darwiche

    University of California, Los Angeles, United States

    7 publications · 160 citations

    7

    h-index

  2. AC
    Arthur Choi

    University of California, Los Angeles, United States

    6 publications · 144 citations

    6

    h-index

  3. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    5 publications · 376 citations

    5

    h-index

  4. GV
    Guy Van den Broeck

    KU Leuven, Belgium

    4 publications · 101 citations

    4

    h-index

  5. JG
    Judy Goldsmith

    University of Kentucky, United States

    4 publications · 258 citations

    4

    h-index

1–5 of 249

Venues

  1. Journal of Computer and System Sciences

    8 publications · 1.4K citations

    8

    h-index

  2. Theoretical Computer Science

    8 publications · 423 citations

    8

    h-index

  3. arXiv (Cornell University)

    Repository · 6 publications · 109 citations

    6

    h-index

  4. SIAM Journal on Computing

    5 publications · 1.9K citations

    5

    h-index

  5. Information and Computation

    5 publications · 134 citations

    5

    h-index

1–5