Testing Linear-Invariant Properties
From MaRDI portal
Publication:5096106
DOI10.1137/21M1397246MaRDI QIDQ5096106
Publication date: 12 August 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.06793
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Arithmetic combinatorics; higher degree uniformity (11B30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The inverse conjecture for the Gowers norm over finite fields in low characteristic
- Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
- The inverse conjecture for the Gowers norm over finite fields via the correspondence principle
- Linear equations in primes
- Self-testing/correcting with applications to numerical problems
- A removal lemma for systems of linear equations over finite fields
- Induced arithmetic removal: complexity 1 patterns over finite fields
- An inverse theorem for the uniformity seminorms associated with the action of \(\mathbb F_p^\infty\)
- The primes contain arbitrarily long arithmetic progressions
- Hypergraph regularity and the multidimensional Szemerédi theorem
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Graph removal lemmas
- On Proximity-Oblivious Testing
- Property testing and its connection to learning and approximation
- Testing Reed–Muller Codes
- A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
- A proof of Green's conjecture regarding the removal properties of sets of linear equations
- The Algorithmic Aspects of the Regularity Lemma
- Robust Characterizations of Polynomials with Applications to Program Testing
- A unified framework for testing linear‐invariant properties
- The hypergraph regularity method and its applications
- Every locally characterized affine-invariant property is testable
- Testing Low Complexity Affine-Invariant Properties
- An inverse theorem for the Gowers \(U^{s+1}[N\)-norm]
- Efficient testing of large graphs
- A new proof of Szemerédi's theorem
- General systems of linear forms: equidistribution and true complexity
This page was built for publication: Testing Linear-Invariant Properties
