OpenAlex
PricingAboutJobs
Log inGet started
Work

Learning Polynomials with Queries: The Highly Noisy Case

HTML

Year: 2000
Type: article
Source: SIAM Journal on Discrete Mathematics
DOI: 10.1137/s0895480198344540
Authors: O. Goldreich, R. Rubinfeld, M. Sudan
Institutions: Weizmann Institute of Science, IBM Research - Thomas J. Watson Research Center
Language: English

Topic: Coding theory and cryptography
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Keywords: black-box learning, polynomial reconstruction, randomized algorithms, finite fields, error-correcting codes

Open Access status: closed
OpenAlex ID: W286346820
FWCI: 19.86
Cites: 53
Cited by: 170
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms