Keyword

approximation complexity

Description: The computational resources needed to approximate solutions to problems, studied in algorithms, optimization, and learning theory.
OpenAlex ID: keywords/approximation-complexity
2018 · Philipp Petersen, Felix Voigtlaender · Neural Networks · 659
2016 · H. N. Mhaskar, T. Poggio · Analysis and Applications · 425
1991 · Viggo Kann · Information Processing Letters · 331
1993 · Leonid G. Khachiyan, Michael J. Todd · Mathematical Programming · 186
1999 · Ralf Diekmann, Andreas Frommer, et al. · Parallel Computing · 166
1994 · Kaizhong Zhang, Tao Jiang · Information Processing Letters · 161
1998 · Ashraf M. Abdelbar, Sandra M. Hedetniemi · Artificial Intelligence · 149
2011 · Mathias Hauptmann, Richard Schmied, et al. · Journal of Discrete Algorithms · 110
2002 · René Sitters · Lecture notes in computer science · 109
1983 · Kenneth J. Supowit, Edward M. Reingold · Acta Informatica · 108
1996 · Sanjeev Khanna, Rajeev Motwani · ACM Symposium on Theory of Computing (STOC) · 105
2000 · Paolo Liberatore · Artificial Intelligence · 81
2017 · Leslie Ann Goldberg, Heng Guo · Computational Complexity · 77
2002 · Punnen, Margot, et al. · Algorithmica · 66
1998 · Yinyu Ye · Mathematical Programming · 63
1974 · Sartaj Sahni, Teofilo Gonzales · Annual Symposium on Switching & Automata Theory · 54
2000 · V.D. Blondel, S. Gaubert, et al. · IEEE Transactions on Automatic Control · 51
2007 · Xi Chen, Shang‐Hua Teng, et al. · Symposium on Discrete Algorithms · 50
2011 · Harry Yserentant · ESAIM Mathematical Modelling and Numerical Analysis · 47
2001 · Chandra Chekuri, Sanjeev Khanna · Lecture notes in computer science · 42
2016 · Péter Györgyi, Tamás Kis · European Journal of Operational Research · 41
2022 · Jiarui Gan, Rupak Majumdar, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 38
2005 · Hassene Aissi, Cristina Bazgan, et al. · Lecture notes in computer science · 38
Works count: 272
Citation count: 5,560
Year
Topic
Type