Sparse Polynomial Algorithms is a computational method in computational algebra that specializes in efficiently manipulating and operating on polynomials represented sparsely, where only nonzero terms are stored and processed, distinguishing it from dense polynomial algorithms by exploiting the sparsity structure to reduce time and space complexity.
178
Publications
7K
Citations
268
Authors
166
Institutions
Publications per year
2017–2026
21
Parents
Publications
178
A deterministic algorithm for sparse multivariate polynomial interpolation
Michael Ben-Or · 1988 · 309 citations · Full text
A polyhedral method for solving sparse polynomial systems
Birkett Huber, Bernd Sturmfels · Mathematics of Computation · 1995 · 203 citations · Full text
1–5 of 178
Authors
268
- EK
12
h-index
- MM
9
h-index
- MG
8
h-index
- GL
7
h-index
- JM
6
h-index
1–5 of 268
Institutions
166
Centre National de la Recherche Scientifique
Paris, France
12 h-index
21 publications
1.1K citations
University of Waterloo
Waterloo, Canada
11 h-index
21 publications
582 citations
Simon Fraser University
Burnaby, Canada
9 h-index
18 publications
486 citations
Rensselaer Polytechnic Institute
Troy, United States
8 h-index
14 publications
527 citations
Texas A&M University
College Station, United States
8 h-index
8 publications
341 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
7 h-index
10 publications
283 citations
North Carolina State University
Raleigh, United States
7 h-index
9 publications
188 citations
United States Naval Academy
Annapolis, United States
4 h-index
4 publications
101 citations
1–8 of 166
Venues
- Journal of Symbolic Computation
12 publications · 569 citations
11
h-index
- Mathematics of Computation
MCOM · 9 publications · 905 citations
9
h-index
- SIAM Journal on Computing
6 publications · 219 citations
6
h-index
- Journal of Complexity
4 publications · 92 citations
4
h-index
- ACM SIGSAM Bulletin
4 publications · 166 citations
4
h-index
1–5