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, Jung, Kyomin, Rubinfeld, Ronitt |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Elsevier
2017
|
Online Access: | http://hdl.handle.net/1721.1/108433 https://orcid.org/0000-0002-4353-7639 |
Similar Items
-
Local Algorithms for Sparse Spanning Graphs
by: Levi, Reut, et al.
Published: (2016) -
Local Algorithms for Sparse Spanning Graphs
by: Levi, Reut, et al.
Published: (2021) -
Sparse hierarchical regression with polynomials
by: Bertsimas, Dimitris, et al.
Published: (2021) -
Testing Probability Distributions Underlying Aggregated Data
by: Canonne, Clement, et al.
Published: (2016) -
Testing Distributional Assumptions of Learning Algorithms
by: Rubinfeld, Ronitt, et al.
Published: (2023)