Query complexity and the polynomial Freiman–Ruzsa conjecture
Sign Up to like & getrecommendations! Published in 2021 at "Advances in Mathematics"
DOI: 10.1016/j.aim.2021.108043
Abstract: We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at… read more here.
Keywords: ruzsa conjecture; freiman ruzsa; polynomial freiman; complexity ... See more keywords