Computable Reducibility
Computable Reducibility is a formal relation in computability theory that classifies decision problems by permitting one problem to be algorithmically transformed into another via a computable function, thereby establishing relative solvability in terms of Turing reducibility.
120
Publications
5.2K
Citations
170
Authors
132
Institutions
Publications per year
2017–2026
14
Parents
120
Computability on subsets of metric spaces
Vasco Brattka, Gero Presser · Theoretical Computer Science · 2003 · 163 citations
Hidden translation and orbit coset in quantum computing
Katalin Friedl, Gábor Ivanyos, Frédéric Magniez et al. · 2003 · 145 citations
1–5 of 120
170
4
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 170
132
University of Chicago
Chicago, United States
8 h-index
10 publications
326 citations

University of Notre Dame
Notre Dame, United States
6 h-index
9 publications
255 citations

University of Cape Town
Rondebosch, South Africa
5 h-index
5 publications
271 citations

Victoria University of Wellington
Wellington, New Zealand
4 h-index
7 publications
136 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
7 publications
245 citations
University of Cambridge
Cambridge, United Kingdom
4 h-index
4 publications
129 citations

University of Bologna
Bologna, Italy
4 h-index
4 publications
165 citations
George Washington University
Washington, United States
4 h-index
4 publications
152 citations
1–8 of 132
13 publications · 763 citations
13
h-index
11 publications · 354 citations
10
h-index
9 publications · 335 citations
8
h-index
5 publications · 154 citations
5
h-index
TRAN · 5 publications · 225 citations
5
h-index
1–5