Keyword

exponential-time algorithms

Description: Algorithms whose running time grows exponentially with input size, studied in computational complexity and exact algorithms.
OpenAlex ID: keywords/exponential-time-algorithms
1987 · Ravi Kannan · Mathematics of Operations Research · 980
2003 · Gerhard J. Woeginger · Lecture notes in computer science · 813
1985 · Orna Lichtenstein, Amir Pnueli · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 707
2010 · Fedor V. Fomin, Dieter Kratsch · Texts in theoretical computer science · 597
2005 · Ryan Williams · Theoretical Computer Science · 590
1993 · V. J. Rayward-Smith, J. Blazewicz, et al. · Journal of the Operational Research Society · 333
2009 · Fedor V. Fomin, Fabrizio Grandoni, et al. · Journal of the ACM · 308
1985 · B. Monien, E. Speckenmeyer · Discrete Applied Mathematics · 291
2005 · Ramamohan Paturi, Pavel Pudlák, et al. · Journal of the ACM · 288
1981 · Richard Schroeppel, Adi Shamir · SIAM Journal on Computing · 287
2001 · Rajeev Alur, Salvatore La Torre, et al. · Lecture notes in computer science · 253
2008 · Ryan Williams · Information Processing Letters · 250
2010 · Daniele Micciancio, Panagiotis Voulgaris · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 244
1998 · R. Balasubramanian, Michael R. Fellows, et al. · Information Processing Letters · 226
1990 · S.J. Friedman, K.J. Supowit · IEEE Transactions on Computers · 226
2004 · Hans Kellerer, Ulrich Pferschy, et al. · Springer eBooks · 216
1996 · John Rust · Handbook of computational economics · 213
2004 · Coralio Ballester · Games and Economic Behavior · 204
1982 · E. Allen Emerson, Joseph Y. Halpern · ACM Symposium on Theory of Computing (STOC) · 196
1986 · William H.E. Day, David S. Johnson, et al. · Mathematical Biosciences · 184
2015 · Takuya Akiba, Yoichi Iwata · Theoretical Computer Science · 181
2002 · Xiaolei Qian · IEEE International Conference on Data Engineering (ICDE) · 177
2003 · Rolf Niedermeier, Peter Rossmanith · Journal of Algorithms · 167
2002 · R. Paturi, P. Pudlik, et al. · Annual Symposium on Foundations of Computer Science · 167
Works count: 1,016
Citation count: 23,900
Year
Topic
Type