Green's conjecture and testing linear-invariant properties
From MaRDI portal
Publication:5172709
DOI10.1145/1536414.1536438zbMath1304.68204OpenAlexW2129465918MaRDI QIDQ5172709
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1536414.1536438
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Randomized algorithms (68W20)
Related Items (10)
Universal points in the asymptotic spectrum of tensors ⋮ A removal lemma for systems of linear equations over finite fields ⋮ Sparse affine-invariant linear codes are locally testable ⋮ Invariance in Property Testing ⋮ Testing Linear-Invariant Non-linear Properties: A Short Report ⋮ Green’s Conjecture and Testing Linear Invariant Properties ⋮ A unified framework for testing linear‐invariant properties ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Unnamed Item ⋮ Lower bounds for testing triangle-freeness in Boolean functions
This page was built for publication: Green's conjecture and testing linear-invariant properties