Reducibility
Reducibility is a formal relation in computability theory that classifies decision problems by determining whether one problem can be algorithmically transformed into another, thereby establishing relative solvability through the existence of a computable function mapping instances of the first problem to instances of the second.
849
Publications
38K
Citations
2.3K
Authors
837
Institutions
Publications per year
2017–2026
181
849
On the Structure of Polynomial Time Reducibility
Richard E. Ladner · Journal of the ACM · 1975 · 790 citations · Full text
Structural reducibility of multilayer networks
Manlio De Domenico, Vincenzo Nicosia, Àlex Arenas et al. · Nature Communications · 2015 · 651 citations · Full text
Engineering, Bioinformatics, Biology +15
A comparison of polynomial time reducibilities
Richard E. Ladner, Nancy Lynch, Alan L. Selman · Theoretical Computer Science · 1975 · 414 citations
1–5 of 849
2.3K
7
h-index
University at Buffalo, State University of New York, United States
7 publications · 759 citations
7
h-index
6
h-index
5
h-index
5
h-index
1–5 of 2.3K
837

Centre National de la Recherche Scientifique
Paris, France
19 h-index
65 publications
3.1K citations

Chinese Academy of Sciences
Beijing, China
17 h-index
96 publications
4.9K citations
Nanjing University
Nanjing, China
10 h-index
30 publications
2.9K citations
University of Chicago
Chicago, United States
9 h-index
12 publications
319 citations
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
14 publications
642 citations
Tsinghua University
Beijing, China
9 h-index
45 publications
4.2K citations
University of Wisconsin–Madison
Madison, United States
8 h-index
10 publications
603 citations
Université Paris Cité
Paris, France
8 h-index
9 publications
393 citations
1–8 of 837
37 publications · 1.8K citations
23
h-index
TRAN · 18 publications · 666 citations
15
h-index
16 publications · 968 citations
14
h-index
14 publications · 789 citations
14
h-index
12 publications · 733 citations
12
h-index
1–5