Keyword

sparse polynomials

Description: Polynomials containing relatively few nonzero terms compared with their degree or number of variables, studied in algebra and computation.
Wikidata ID: wiki/Q107377261
OpenAlex ID: keywords/sparse-polynomials
1979 · Richard Zippel · Lecture notes in computer science · 1,479
1988 · Michael Ben-Or · ACM Symposium on Theory of Computing (STOC) · 383
2005 · Terence Tao · Mathematical Research Letters · 271
2001 · Adam R. Klivans, Daniel Spielman · ACM Symposium on Theory of Computing (STOC) · 231
2014 · Alexandr Andoni, Rina Panigrahy‎, et al. · International Conference on Machine Learning · 172
1995 · Yishay Mansour · SIAM Journal on Computing · 142
1992 · Jehoshua Bruck, Roman Smolensky · SIAM Journal on Computing · 134
1967 · C.W. Clenshaw · Journal of the Franklin Institute · 132
2005 · J. Bourgain · Journal of the American Mathematical Society · 118
2004 · Masakazu Kojima, Sunyoung Kim, et al. · Mathematical Programming · 117
1973 · Joel Moses, David Y. Y. Yun · ACM Annual Conference · 108
2016 · Sadik Iliman, Timo de Wolff · Research in the Mathematical Sciences · 98
1984 · David A. Plaisted · Theoretical Computer Science · 94
1999 · I. Z. Emiris, B. Mourrain · Algorithmica · 93
1972 · Charles M. Fiduccia · ACM Symposium on Theory of Computing (STOC) · 88
1999 · H. W. Lenstra · De Gruyter eBooks · 87
1970 · László Rédei · Birkhäuser Basel eBooks · 86
2007 · F. Bihan, F. Sottile · Moscow Mathematical Journal · 82
2002 · Carlos D’Andrea · Transactions of the American Mathematical Society · 81
1974 · Stephen C. Johnson · ACM SIGSAM Bulletin · 75
2004 · S. Prajna, A. Papachristodoulou, et al. · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · 74
2007 · Andrew Paul Smith · Journal of Global Optimization · 73
2011 · Malte Beecken, Johannes Mittmann, et al. · Information and Computation · 70
1985 · Erich Kaltofen · Lecture notes in computer science · 67
Works count: 676
Citation count: 8,228
Year
Topic
Type