A New Upper Bound on the Query Complexity of Testing Generalized Reed-Muller Codes

Noga Ron-Zewi, Madhu Sudan. A New Upper Bound on the Query Complexity of Testing Generalized Reed-Muller Codes. Theory of Computing, 9:783-807, 2013. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.