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
Parents
172
On the Power of Quantum Computation
Daniel Simón · SIAM Journal on Computing · 1997 · 1.3K citations
Computing, Computer Science, Physics +14
Stochastic Complexity and Modeling
J. Rissanen · The Annals of Statistics · 1986 · 950 citations · Full text
Probabilistic computations: Toward a unified measure of complexity
Andrew Chi-Chin Yao · 1977 · 892 citations
1–5 of 172
249
7
h-index
6
h-index
5
h-index
4
h-index
4
h-index
1–5 of 249
171

University of Rochester
Rochester, United States
9 h-index
10 publications
532 citations
University of California, Los Angeles
Los Angeles, United States
6 h-index
16 publications
375 citations

University of Warwick
Coventry, United Kingdom
5 h-index
4 publications
95 citations

Institute for Advanced Study
Princeton, United States
5 h-index
8 publications
381 citations
KU Leuven
Leuven, Belgium
5 h-index
7 publications
348 citations

Pennsylvania State University
State College, United States
4 h-index
5 publications
181 citations
IBM (United States)
Armonk, United States
4 h-index
5 publications
549 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
4 h-index
5 publications
247 citations
1–8 of 171
8 publications · 1.4K citations
8
h-index
8 publications · 423 citations
8
h-index
Repository · 6 publications · 109 citations
6
h-index
5 publications · 1.9K citations
5
h-index
5 publications · 134 citations
5
h-index
1–5