Keyword

self-reducibility

Description: A property in computational complexity in which a problem can be reduced to itself, enabling parts of an instance to be solved through related instances.
OpenAlex ID: keywords/self-reducibility
2003 · Katalin Friedl, Gábor Ivanyos, et al. · ACM Symposium on Theory of Computing (STOC) · 134
1976 · Claus-Peter Schnorr · International Colloquium on Automata, Languages and Programming · 122
1988 · Richard M. Karp, Eli Upfal, et al. · Journal of Computer and System Sciences · 110
2002 · Amihood Amir, Richard Beigel, et al. · Information and Computation · 99
2010 · Eric Allender, Michal Koucký · Journal of the ACM · 95
1996 · Lane A. Hemaspaandra, Ashish V. Naik, et al. · SIAM Journal on Computing · 81
1999 · Dana Randall, David Wilson · Symposium on Discrete Algorithms · 72
2005 · Jin-Yi Cai, Venkatesan T. Chakaravarthy, et al. · Information and Computation · 56
1996 · Edith Hemaspaandra, Ashish V. Naik, et al. · Journal of Computer and System Sciences · 53
2016 · Nadia Creignou, Arne Meier, et al. · Theory of Computing Systems · 52
2014 · Katalin Friedl, Gábor Ivanyos, et al. · SIAM Journal on Computing · 51
1985 · R M Karp, E Upfal, et al. · ACM Symposium on Theory of Computing (STOC) · 51
2003 · Katalin Friedl, Gábor Ivanyos, et al. · ACM Symposium on Theory of Computing (STOC) · 48
1990 · JoséL. Balcázar · Journal of Computer and System Sciences · 48
2000 · Manindra Agrawal, Thomas Thierauf · SIAM Journal on Computing · 46
1993 · S. Ar, M. Blum, et al. · ACM Symposium on Theory of Computing (STOC) · 44
1988 · Alan L. Selman · Information and Computation · 42
2002 · H. Buhrman, P. van Helden, et al. · IEEE Conference on Computational Complexity (CCC) · 39
2015 · Péter L. Erdős, Sándor Z. Kiss, et al. · PLoS ONE · 33
2002 · M. Agrawal, T. Thierauf · Annual Symposium on Foundations of Computer Science · 32
2002 · R. Beigel, M. Kummer, et al. · IEEE Conference on Computational Complexity (CCC) · 31
1995 · LANE A. HEMASPAANDRA, ALBRECHT HOENE, et al. · International Journal of Foundations of Computer Science · 31
2004 · Harold N. Gabow · ACM Symposium on Theory of Computing (STOC) · 29
2002 · R. Beigel, M. Bellare, et al. · Annual Symposium on Foundations of Computer Science · 25
2007 · Harold N. Gabow · SIAM Journal on Computing · 23
Works count: 135
Citation count: 2,054
Year
Topic
Type