Randomized Reductions
Randomized Reductions is a computational method in randomized complexity theory that transforms one problem into another with bounded error probability, distinguishing it from deterministic reductions by incorporating randomness to achieve correctness with high probability.
39
Publications
2.4K
Citations
57
Authors
41
Institutions
Publications per year
2017–2026
4
Parents
39
Splitters and near-optimal derandomization
Moni Naor, Leonard J. Schulman, A. Srinivasan · 2002 · 306 citations
On the Hardness of Graph Isomorphism
Jacobo Torán · SIAM Journal on Computing · 2004 · 107 citations
1–5 of 39
57
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 57
41

Cornell University
Ithaca, United States
4 h-index
8 publications
147 citations
University of Michigan
Ann Arbor, United States
3 h-index
6 publications
332 citations
University of California, Irvine
Irvine, United States
3 h-index
4 publications
139 citations
University at Buffalo, State University of New York
Buffalo, United States
2 h-index
4 publications
144 citations

Bar-Ilan University
Ramat Gan, Israel
2 h-index
4 publications
247 citations
IBM Research - Almaden
San Jose, United States
2 h-index
2 publications
414 citations

University of Maine
Orono, United States
2 h-index
6 publications
114 citations
California Institute of Technology
Pasadena, United States
2 h-index
2 publications
63 citations
1–8 of 41
6 publications · 427 citations
6
h-index
4 publications · 124 citations
4
h-index
2 publications · 125 citations
2
h-index
Conference · 1 publications · 67 citations
1
h-index
1 publications · 23 citations
1
h-index
1–5