"A New Upper Bound on the Query Complexity for Testing Generalized ..."

Noga Ron-Zewi, Madhu Sudan (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-32512-0_54

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/approx/Ron-ZewiS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/Ron-ZewiS12
Noga Ron-Zewi, Madhu Sudan:
A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes. APPROX-RANDOM 2012: 639-650

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.