Pages that link to "Item:Q2237416"

The following pages link to Query complexity and the polynomial Freiman-Ruzsa conjecture (Q2237416):

Displaying 8 items.

• The black-box query complexity of polynomial summation (Q626615) (← links)
• Higher convexity and iterated sum sets (Q2151174) (← links)
• An analytic approach to cardinalities of sumsets (Q2151183) (← links)
• Simple PCPs with poly-log rate and query complexity (Q3581427) (← links)
• Query complexity and the polynomial Freiman-Ruzsa conjecture (Q6336453) (← links)
• Unbounded expansion of polynomials and products (Q6624741) (← links)
• A better than \(3/2\) exponent for iterated sums and products over \(\mathbb{R}\) (Q6644152) (← links)
• Finding large additive and multiplicative Sidon sets in sets of integers (Q6663187) (← links)