Randomized Complexity
Randomized Complexity is a subfield of computational complexity theory that analyzes the computational resources needed by randomized algorithms or probabilistic Turing machines to solve decision and function problems with specified bounds on running time and error probability, typically formalized via probabilistic complexity classes such as BPP, RP, and ZPP.
1.3K
Publications
72.7K
Citations
1.6K
Authors
541
Institutions
Publications per year
2017–2026
134
1.3K
Manindra Agrawal, Neeraj Kayal, Nitin Saxena · Annals of Mathematics · 2004 · 922 citations · Full text
1–5 of 1.3K
1.6K
19
h-index
University of California San Diego, United States
15 publications · 1.3K citations
15
h-index
14
h-index
13
h-index
13
h-index
1–5 of 1.6K
541
Massachusetts Institute of Technology
Cambridge, United States
33 h-index
80 publications
5.6K citations

Tel Aviv University
Tel Aviv, Israel
31 h-index
84 publications
6.5K citations
Princeton University
Princeton, United States
27 h-index
56 publications
3.7K citations

Weizmann Institute of Science
Rehovot, Israel
24 h-index
46 publications
4.7K citations
University of California, Berkeley
Berkeley, United States
24 h-index
52 publications
7K citations
University of Washington
Seattle, United States
23 h-index
55 publications
2.4K citations
University of California San Diego
San Diego, United States
23 h-index
43 publications
3K citations
Carnegie Mellon University
Pittsburgh, United States
23 h-index
57 publications
2.4K citations
1–8 of 541
114 publications · 7.4K citations
48
h-index
55 publications · 2.4K citations
28
h-index
35 publications · 4.1K citations
26
h-index
JACM · 28 publications · 3.9K citations
24
h-index
CC · 30 publications · 2.1K citations
21
h-index
1–5