Keyword

Turing reductions

Description: Turing reductions are computability and complexity theory methods that solve one problem using an oracle for another problem.
Wikidata ID: wiki/Q4489310
OpenAlex ID: keywords/turing-reductions
1996 · J. L. Ram�rez-Alfons�n · COMBINATORICA · 158
2006 · Yi-Kai Liu · Lecture notes in computer science · 157
2003 · M. Ajtai, R. Kumar, et al. · IEEE Conference on Computational Complexity (CCC) · 113
2008 · Friedrich Eisenbrand, Thomas Rothvoß · IEEE Real-Time Systems Symposium (RTSS) · 96
2010 · David Buchfuhrer, Christopher Umans · Journal of Computer and System Sciences · 89
1991 · VIKTÓRIA ZANKÓ · International Journal of Foundations of Computer Science · 86
1995 · R. Beigel, M. Kummer, et al. · Information and Computation · 77
1988 · Richard Beigel · 73
1989 · Jin-Yi Cai, Lane A. Hemachandra · Information and Computation · 65
1980 · Stephen R. Mahaney · Annual Symposium on Foundations of Computer Science · 52
1991 · Ker-I Ko · SIAM Journal on Computing · 49
1982 · Erich Kaltofen · ACM Symposium on Theory of Computing (STOC) · 44
2016 · Hirahara, Shuichi, Watanabe, Osamu · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 40
2012 · Samuel R. Buss, Alan S. Johnson · Annals of Pure and Applied Logic · 38
2008 · Harry Buhrman, John M. Hitchcock · IEEE Conference on Computational Complexity (CCC) · 36
2001 · A. Pavan, Alan L. Selman · SIAM Journal on Computing · 33
2002 · R. Beigel, M. Kummer, et al. · IEEE Conference on Computational Complexity (CCC) · 32
2025 · Chiodo, Maurice, Müller, Dennis, et al. · arXiv (Cornell University) · 31
2008 · David Buchfuhrer, Christopher Umans · Lecture notes in computer science · 31
2024 · Jingyi Mei, Tim Coopmans, et al. · Lecture notes in computer science · 30
1979 · Leonard M. Adleman, Kenneth Manders · Annual Symposium on Foundations of Computer Science · 30
1990 · John Shackell · Journal of Symbolic Computation · 28
1986 · Li’ang Zhang, Suyun Geng · Journal of Computer Science and Technology · 28
2005 · Christian Glaßer, Alan L. Selman, et al. · Information and Computation · 27
2018 · Arti Pandey, B.S. Panda · Discrete Applied Mathematics · 26
Works count: 187
Citation count: 2,214
Year
Topic
Type