Keyword

subexponential time

Description: Subexponential time describes computational running times that grow more slowly than every exponential function of the input size.
OpenAlex ID: keywords/subexponential-time
2004 · Valentine Kabanets, Russell Impagliazzo · Computational Complexity · 407
2005 · Greg Kuperberg · SIAM Journal on Computing · 406
1996 · J. Matoušek, M. Sharir, et al. · Algorithmica · 315
2013 · Andrew Childs, David Jao, et al. · Journal of Mathematical Cryptology · 246
· Andrew M. Childs, David Jao, et al. · 238
1992 · Gil Kalai · ACM Symposium on Theory of Computing (STOC) · 159
1997 · Paul Dagum, Michael Luby · Artificial Intelligence · 112
2001 · Russell Impagliazzo, Avi Wigderson · Journal of Computer and System Sciences · 110
2006 · Marcin Jurdzinski, Michael S. Paterson, et al. · University of Warwick · 108
1995 · W. Ludwig · Information and Computation · 108
2008 · Marcin Jurdziński, Mike Paterson, et al. · SIAM Journal on Computing · 105
2002 · R. Impagliazzo, A. Wigderson · Annual Symposium on Foundations of Computer Science · 95
1992 · D. Yu. Grigor'ev, N. N. Vorobjov · Computational Complexity · 74
2001 · Valentine Kabanets · Journal of Computer and System Sciences · 69
2006 · Marcin Jurdziński, Mike Paterson, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 68
2013 · Parinya Chalermsook, Bundit Laekhanukit, et al. · Annual Symposium on Foundations of Computer Science · 58
2004 · Fedor V. Fomin, Dimitrios M. Thilikos · Lecture notes in computer science · 57
2004 · Ilya Kapovich, Alexei Myasnikov, et al. · Advances in Mathematics · 54
1995 · Birgit Jenner, Jacobo Torán · Theoretical Computer Science · 53
2001 · Harry Buhrman, John Tromp, et al. · Lecture notes in computer science · 51
2013 · Philip N. Klein, Daniel Marx · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 49
2004 · Jianer Chen, B. Chor, et al. · IEEE Conference on Computational Complexity (CCC) · 47
2017 · Igor C. Oliveira, Rahul Santhanam · ACM Symposium on Theory of Computing (STOC) · 34
2012 · Lokshtanov, Daniel, Saurabh, Saket, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 34
1994 · Sergei Evdokimov · Lecture notes in computer science · 30
Works count: 156
Citation count: 3,754
Year
Topic
Type