A new upper bound on the query complexity for testing generalized Reed-Muller codes

Noga Ron-Zewi
, Madhu Sudan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Overview
Fingerprint

Fingerprint

Dive into the research topics of 'A new upper bound on the query complexity for testing generalized Reed-Muller codes'. Together they form a unique fingerprint.

Sort by

Weight
Alphabetically

Keyphrases

Mathematics

Computer Science

Powered by Pure Link opens in a new tab, Scopus Link opens in a new tab & Elsevier Fingerprint Engine™ Link opens in a new tab

All content on this site: Copyright © 2026 University of Haifa, its licensors, and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the relevant licensing terms apply

We use cookies to help provide and enhance our service and tailor content. By continuing you agree to the use of cookies

This Research Portal is maintained by the Younes and Soraya Nazarian Library at the University of Haifa, Israel.

About web accessibility Link opens in a new tab

Report vulnerability Link opens in a new tab