Faster sparse multivariate polynomial interpolation of straight-line programs
2
Computer Science Department, United States Naval Academy, Annapolis, MD, USA
|
Publication type: Journal Article
Publication date: 2016-07-01
scimago Q2
wos Q2
SJR: 0.533
CiteScore: 2.2
Impact factor: 1.1
ISSN: 07477171, 1095855X
Computational Mathematics
Algebra and Number Theory
Abstract
Given a straight-line program whose output is a polynomial function of the inputs, we present a new algorithm to compute a concise representation of that unknown function. Our algorithm can handle any case where the unknown function is a multivariate polynomial, with coefficients in an arbitrary finite field, and with a reasonable number of nonzero terms but possibly very large degree. It is competitive with previously known sparse interpolation algorithms that work over an arbitrary finite field, and provides an improvement when there are a large number of variables.
Found
Nothing found, try to update filter.
Found
Nothing found, try to update filter.
Top-30
Journals
|
1
2
3
|
|
|
Journal of Symbolic Computation
3 publications, 15.79%
|
|
|
Journal of Complexity
2 publications, 10.53%
|
|
|
Lecture Notes in Computer Science
2 publications, 10.53%
|
|
|
ACM Communications in Computer Algebra
1 publication, 5.26%
|
|
|
Journal of Fourier Analysis and Applications
1 publication, 5.26%
|
|
|
Applied and Computational Harmonic Analysis
1 publication, 5.26%
|
|
|
Advances in Applied Mathematics
1 publication, 5.26%
|
|
|
Applicable Algebra in Engineering, Communications and Computing
1 publication, 5.26%
|
|
|
1
2
3
|
Publishers
|
1
2
3
4
5
6
7
|
|
|
Elsevier
7 publications, 36.84%
|
|
|
Association for Computing Machinery (ACM)
6 publications, 31.58%
|
|
|
Springer Nature
4 publications, 21.05%
|
|
|
Institute of Electrical and Electronics Engineers (IEEE)
2 publications, 10.53%
|
|
|
1
2
3
4
5
6
7
|
- We do not take into account publications without a DOI.
- Statistics recalculated weekly.
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
19
Total citations:
19
Citations from 2024:
4
(21.05%)
Cite this
GOST |
RIS |
BibTex
Cite this
GOST
Copy
Arnold A., Giesbrecht M., Roche D. S. Faster sparse multivariate polynomial interpolation of straight-line programs // Journal of Symbolic Computation. 2016. Vol. 75. pp. 4-24.
GOST all authors (up to 50)
Copy
Arnold A., Giesbrecht M., Roche D. S. Faster sparse multivariate polynomial interpolation of straight-line programs // Journal of Symbolic Computation. 2016. Vol. 75. pp. 4-24.
Cite this
RIS
Copy
TY - JOUR
DO - 10.1016/j.jsc.2015.11.005
UR - https://doi.org/10.1016/j.jsc.2015.11.005
TI - Faster sparse multivariate polynomial interpolation of straight-line programs
T2 - Journal of Symbolic Computation
AU - Arnold, Andrew
AU - Giesbrecht, Mark
AU - Roche, Daniel S.
PY - 2016
DA - 2016/07/01
PB - Elsevier
SP - 4-24
VL - 75
SN - 0747-7171
SN - 1095-855X
ER -
Cite this
BibTex (up to 50 authors)
Copy
@article{2016_Arnold,
author = {Andrew Arnold and Mark Giesbrecht and Daniel S. Roche},
title = {Faster sparse multivariate polynomial interpolation of straight-line programs},
journal = {Journal of Symbolic Computation},
year = {2016},
volume = {75},
publisher = {Elsevier},
month = {jul},
url = {https://doi.org/10.1016/j.jsc.2015.11.005},
pages = {4--24},
doi = {10.1016/j.jsc.2015.11.005}
}