scientific article

DOI10.4086/toc.2011.v007a006zbMath1246.68259OpenAlexW2083766801MaRDI QIDQ3002831

Victor Chen, Madhu Sudan, Ning Xie, Arnab Bhattacharyya

Publication date: 24 May 2011

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2011.v007a006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Fourier analysismatroidsproperty testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Combinatorial aspects of matroids and geometric lattices (05B35) Randomized algorithms (68W20)

Related Items (6)

Testing Linear-Invariant Properties ⋮ Unnamed Item ⋮ Sparse affine-invariant linear codes are locally testable ⋮ A unified framework for testing linear‐invariant properties ⋮ Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity ⋮ Unnamed Item

This page was built for publication: