A local decision test for sparse polynomials
An ℓ-sparse (multivariate) polynomial is a polynomial containing at most ℓ-monomials in its explicit description. We assume that a polynomial is implicitly represented as a black-box: on an input query from the domain, the black-box replies with the evaluation of the polynomial at that input. We pro...
Main Authors: | Grigorescu, Elena (Contributor), Jung, Kyomin (Author), Rubinfeld, Ronitt (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), rubinfeld, ronitt (Contributor) |
Format: | Article |
Language: | English |
Published: |
Elsevier,
2017-04-26T20:25:21Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Local Algorithms for Sparse Spanning Graphs
by: Levi, Reut, et al.
Published: (2016) -
Testing Probability Distributions Underlying Aggregated Data
by: Canonne, Clement, et al.
Published: (2016) -
Improved local computation algorithm for set cover via sparsification
by: Mitrović, Slobodan, et al.
Published: (2021) -
Testing non-uniform k-wise independent distributions over product spaces (extended abstract)
by: Rubinfeld, Ronitt, et al.
Published: (2012) -
Testing Similar Means
by: Levi, Reut, et al.
Published: (2020)