PP Complexity Class is a complexity class that consists of decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability strictly less than 1/2 for all instances, distinguishing it from other probabilistic classes by its unbounded error characteristic.
36
Publications
3.6K
Citations
55
Authors
41
Institutions
Publications per year
2017–2026
2
Publications
36
PP is as Hard as the Polynomial-Time Hierarchy
Seinosuke Toda · SIAM Journal on Computing · 1991 · 677 citations
On the computational power of PP and (+)P
Seinosuke Toda · 1989 · 236 citations
1–5 of 36
Authors
55
- SA
5
h-index
- ST
4
h-index
- RB
4
h-index
- JT
3
h-index
- AW
3
h-index
1–5 of 55
Institutions
41
University of Electro-Communications
Tokyo, Japan
3 h-index
3 publications
336 citations
Yale University
New Haven, United States
3 h-index
5 publications
557 citations
Universität Ulm
Ulm, Germany
3 h-index
4 publications
310 citations
University of California, Los Angeles
Los Angeles, United States
3 h-index
8 publications
474 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
2 h-index
3 publications
288 citations
University of Rochester
Rochester, United States
2 h-index
3 publications
220 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
2 h-index
2 publications
100 citations
University of Waterloo
Waterloo, Canada
2 h-index
2 publications
343 citations
1–8 of 41
Venues
- SIAM Journal on Computing
4 publications · 950 citations
4
h-index
- Journal of Computer and System Sciences
3 publications · 211 citations
3
h-index
- Journal of Artificial Intelligence Research
JAIR · 3 publications · 241 citations
3
h-index
- Theoretical Computer Science
2 publications · 27 citations
2
h-index
- Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
2 publications · 619 citations
2
h-index
1–5