Pages that link to "Item:Q4933377"
From MaRDI portal
The following pages link to Optimal Testing of Reed-Muller Codes (Q4933377):
Displaying 21 items.
- An improved test of Boolean functions for \(k\)-dimensionality (Q465929) (← links)
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- A new lower bound on the second-order nonlinearity of a class of monomial bent functions (Q2179505) (← links)
- Improving lower bounds on the second-order nonlinearity of three classes of Boolean functions (Q2305896) (← links)
- An optimal tester for \(k\)-Linear (Q2690878) (← links)
- Testing properties of functions on finite groups (Q2830241) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Making the Long Code Shorter (Q3449561) (← links)
- Local Testing of Lattices (Q4565131) (← links)
- Optimal Testing of Reed-Muller Codes (Q4933377) (← links)
- (Q4993289) (← links)
- Sample-Based High-Dimensional Convexity Testing. (Q5002640) (← links)
- (Q5002642) (← links)
- (Q5009557) (← links)
- Almost optimal distribution-free junta testing (Q5091752) (← links)
- (Q5140839) (← links)
- Direct Sum Testing (Q5348457) (← links)
- On Active and Passive Testing (Q5364269) (← links)
- Almost Optimal Testers for Concise Representations. (Q6084348) (← links)
