Many-One Reducibility is a type of reducibility in computability theory where a set \( A \) is said to be many-one reducible to a set \( B \) if there exists a total computable function \( f \) such that \( x \in A \) if and only if \( f(x) \in B \).
26
Publications
1.2K
Citations
39
Authors
19
Institutions
Publications per year
2017–2026
1
Variants
M-reducibility
Parents
Publications
26
1–5 of 26
Authors
39
- MO
3
h-index
- SR
2
h-index
- ST
2
h-index
- JT
2
h-index
- HV
1
h-index
1–5 of 39
Institutions
19
Cornell University
Ithaca, United States
3 h-index
3 publications
354 citations
University of California San Diego
San Diego, United States
1 h-index
1 publications
32 citations
The Ohio State University
Columbus, United States
1 h-index
1 publications
15 citations
Hebrew University of Jerusalem
Jerusalem, Israel
1 h-index
2 publications
22 citations
Universität Ulm
Ulm, Germany
1 h-index
1 publications
17 citations
Heidelberg University
Heidelberg, Germany
1 h-index
1 publications
10 citations
Loyola University Chicago
Chicago, United States
1 h-index
1 publications
11 citations
McMaster University
Hamilton, Canada
1 h-index
1 publications
32 citations
1–8 of 19
Venues
- SIAM Journal on Computing
6 publications · 430 citations
6
h-index
- Journal of Symbolic Logic
4 publications · 107 citations
4
h-index
- Journal of Computer and System Sciences
2 publications · 331 citations
2
h-index
- ArXiv.org
Repository · 1 publications · 16 citations
1
h-index
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
Repository · 1 publications · 22 citations
1
h-index
1–5