Reductions
Reduction is a formal method in computational complexity theory that establishes the relative difficulty of computational problems by transforming instances of one problem into instances of another, thereby enabling the classification of problems into complexity classes based on their solvability.
3.9K
Publications
211.7K
Citations
14.1K
Authors
3.8K
Institutions
Publications per year
2017–2026
629
3.9K
Karine Spiegel, Esra Tasali, Plamen D. Penev et al. · Annals of Internal Medicine · 2004 · 2.4K citations
Medicine, Endocrinology, Physiology +17
Stephen Ross, Anthony P. Bossis, Jeffrey Guss et al. · Journal of Psychopharmacology · 2016 · 1.7K citations · Full text
Medicine, Oncology, Pharmacology +17
Reduction Techniques for Instance-Based Learning Algorithms
D.R. Wilson, Tony Martinez · Machine Learning · 2000 · 1.2K citations · Full text
1–5 of 3.9K
14.1K
40
h-index
13
h-index
Purdue University West Lafayette, United States
14 publications · 958 citations
13
h-index
13
h-index
11
h-index
1–5 of 14.1K
3.8K

Centre National de la Recherche Scientifique
Paris, France
31 h-index
207 publications
30.6K citations
University of Michigan
Ann Arbor, United States
27 h-index
124 publications
7K citations
Stanford University
Stanford, United States
25 h-index
66 publications
5.4K citations

Imperial College London
London, United Kingdom
23 h-index
121 publications
5.7K citations
University of California, Berkeley
Berkeley, United States
23 h-index
61 publications
5K citations

Johns Hopkins University
Baltimore, United States
23 h-index
75 publications
15.3K citations

University of Toronto
Toronto, Canada
23 h-index
72 publications
6.3K citations
Harvard University
Cambridge, United States
22 h-index
78 publications
4.3K citations
1–8 of 3.8K
JACS · 89 publications · 6.7K citations
50
h-index
JOC · 106 publications · 5.9K citations
46
h-index
Repository · 103 publications · 3.5K citations
33
h-index
39 publications · 1.7K citations
26
h-index
29 publications · 1.1K citations
22
h-index
1–5