Many-one Reductions
Many-One Reduction is a formal method in computability theory that maps instances of one decision problem to instances of another such that the answer is preserved, thereby enabling the relative solvability of problems through a computable function.
31
Publications
1.3K
Citations
48
Authors
33
Institutions
Publications per year
2017–2026
2
Variants
M-reductions
31
On the Hardness of Graph Isomorphism
Jacobo Torán · SIAM Journal on Computing · 2004 · 107 citations
Eric Allender, Harry Buhrman, Michal Koucký et al. · SIAM Journal on Computing · 2006 · 93 citations
1–5 of 31
48
Rutgers, The State University of New Jersey, United States
3 publications · 145 citations
3
h-index
Czech Academy of Sciences, Institute of Mathematics, Czechia
2 publications · 116 citations
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 48
33

Cornell University
Ithaca, United States
3 h-index
3 publications
354 citations

University of Rochester
Rochester, United States
2 h-index
2 publications
49 citations

University of Amsterdam
Amsterdam, The Netherlands
2 h-index
2 publications
116 citations
University of Chicago
Chicago, United States
2 h-index
3 publications
102 citations

University of Toronto
Toronto, Canada
2 h-index
3 publications
108 citations
University at Buffalo, State University of New York
Buffalo, United States
2 h-index
4 publications
94 citations

McMaster University
Hamilton, Canada
1 h-index
1 publications
32 citations
University of Wisconsin–Madison
Madison, United States
1 h-index
1 publications
93 citations
1–8 of 33
6 publications · 291 citations
6
h-index
IJFCS · 2 publications · 112 citations
2
h-index
2 publications · 331 citations
2
h-index
Repository · 1 publications · 19 citations
1
h-index
Repository · 1 publications · 22 citations
1
h-index
1–5