Testing sumsets is hard
From MaRDI portal
Cites work
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- An additive combinatorics approach relating rank to communication complexity
- An improved analysis of linear mergers
- Approximating sumset size
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Efficient testing of large graphs
- Extracting Randomness Using Few Independent Sources
- Finite field models in additive combinatorics
- Hardness of computing clique number and chromatic number for Cayley graphs
- scientific article; zbMATH DE number 3425719 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Large sets in finite fields are sumsets
- Low-degree tests at large distances
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Nonnegative integral subset representations of integer sets
- On Finding Small 2-Generating Sets
- On Monotonicity Testing and Boolean Isoperimetric-type Theorems
- Open problems in additive combinatorics
- Parallel repetition for the GHZ game: exponential decay
- Property testing in bounded degree graphs
- Self-testing/correcting with applications to numerical problems
- Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
- Some algorithmic results for [2]-sumset covers
- Sumsets in the hypercube
- Testing juntas nearly optimally
- Testing low-degree polynomials over prime fields
- Testing subgraphs in large graphs
This page was built for publication: Testing sumsets is hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322400)
