Keyword

pseudo-polynomial time algorithm

Description: An algorithm whose running time is polynomial in the numerical magnitudes of input values, but may be exponential in their bit-lengths.
OpenAlex ID: keywords/pseudo-polynomial-time-algorithm
1990 · Jianzhong Du, Joseph Y.-T. Leung · Mathematics of Operations Research · 843
1978 · M. R. Garey, D. S. Johnson · Journal of the ACM · 823
1990 · S.K. Baruah, A.K. Mok, et al. · IEEE Real-Time Systems Symposium (RTSS) · 802
1981 · Christos H. Papadimitriou · Journal of the ACM · 687
1977 · Eugene L. Lawler · Annals of discrete mathematics · 685
1990 · Sanjoy K. Baruah, Louis E. Rosier, et al. · Real-Time Systems · 651
1996 · Uri Zwick, Mike Paterson · Theoretical Computer Science · 613
1984 · Jeffrey M. Jaffe · Networks · 424
1988 · Martin Desrochers, Francois Soumis · INFOR Information Systems and Operational Research · 419
1989 · Jianzhong Du, Joseph Y.-T. Leung · SIAM Journal on Discrete Mathematics · 363
1991 · Douglas R Shier · 345
2001 · Chung-Yee Lee, Zhi-Long Chen · Journal of Scheduling · 337
2018 · Siddharth Barman, Sanath Kumar Krishnamurthy, et al. · ACM Conference on Economics and Computation (EC) · 315
1999 · Sanjoy Baruah, Deji Chen, et al. · Real-Time Systems · 290
1980 · Luc N. Van Wassenhove, Ludo F. Gelders · European Journal of Operational Research · 256
1998 · Gang Yu, Jian Yang · Computers & Operations Research · 255
2005 · Dimitris Fotakis, Spyros Kontogiannis, et al. · Theoretical Computer Science · 247
1999 · C.-Y. Lee · International Journal of Production Research · 244
2012 · Sanjoy Baruah, Vincenzo Bonifaci, et al. · IEEE Real-Time Systems Symposium (RTSS) · 237
2010 · Dorothée Honhon, Vishal Gaur, et al. · Operations Research · 229
2006 · T.C.E. Cheng, C.T. Ng, et al. · Theoretical Computer Science · 215
1998 · Madhav V Marathe, R Ravi, et al. · Journal of Algorithms · 212
2001 · C.-Y. Lee, V.J. Leon · European Journal of Operational Research · 204
Works count: 1,484
Citation count: 32,660
Year
Topic
Type