A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes (Q3167433)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes |
scientific article |
Statements
A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes (English)
0 references
2 November 2012
0 references
