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
36
Towards a complexity theory for local distributed computing
Pierre Fraigniaud, Amos Korman, David Peleg · Journal of the ACM · 2013 · 116 citations
Approximate counting in bounded arithmetic
Emil Jeřábek · Journal of Symbolic Logic · 2007 · 69 citations
1–5 of 36
58
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 58
46
University of Kaiserslautern
Kaiserslautern, Germany
3 h-index
5 publications
147 citations
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
4 publications
698 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
3 publications
246 citations
Iowa State University
Ames, United States
2 h-index
2 publications
60 citations
Université Paris Cité
Paris, France
2 h-index
3 publications
246 citations

Cornell University
Ithaca, United States
2 h-index
2 publications
72 citations

Weizmann Institute of Science
Rehovot, Israel
2 h-index
2 publications
141 citations
University of California, Berkeley
Berkeley, United States
2 h-index
1 publications
14 citations
1–8 of 46
5 publications · 150 citations
5
h-index
3 publications · 407 citations
3
h-index
3 publications · 109 citations
3
h-index
JACM · 2 publications · 142 citations
2
h-index
2 publications · 622 citations
2
h-index
1–5