Randomized Complexity Classes

Randomized Complexity Classes is a complexity class category in computational complexity theory that consists of decision problems solvable by probabilistic Turing machines within specified resource bounds, distinguished from deterministic classes by the use of randomness in computation.

36

Publications

2.2K

Citations

58

Authors

46

Institutions

Publications per year

2017–2026

2

Authors

58

  1. SH
    Stefan Heinrich

    Universität Hamburg, Germany

    2 publications · 49 citations

    2

    h-index

  2. BM
    Bernhard Milla

    University of Kaiserslautern, Germany

    2 publications · 49 citations

    2

    h-index

  3. RV
    Ronald V. Book

    University of California, Santa Barbara, United States

    2 publications · 52 citations

    2

    h-index

  4. AC
    Andrea Clementi

    University of Rome Tor Vergata, Italy

    1 publications · 11 citations

    1

    h-index

  5. RI
    Russell Impagliazzo

    University of California San Diego, United States

    1 publications · 50 citations

    1

    h-index

1–5 of 58

Venues

  1. Journal of Complexity

    5 publications · 150 citations

    5

    h-index

  2. SIAM Journal on Computing

    3 publications · 407 citations

    3

    h-index

  3. Theory of Computing Systems

    3 publications · 109 citations

    3

    h-index

  4. Journal of the ACM

    JACM · 2 publications · 142 citations

    2

    h-index

  5. Journal of Computer and System Sciences

    2 publications · 622 citations

    2

    h-index

1–5