A refinement of Cauchy-Schwarz complexity
From MaRDI portal
Publication:2674565
Recommendations
- Complexity of approximation problems
- On convex complexity measures
- scientific article; zbMATH DE number 1206797
- scientific article; zbMATH DE number 5528957
- COMPUTATIONAL COMPLEXITY OF THE SCHWARZ ALTERNATING PROCEDURE
- Complexity for some classes of well-posed problems
- On the approximation complexity hierarchy
- Complexity estimates for representations of Schmüdgen type.
- scientific article; zbMATH DE number 3917710
- scientific article; zbMATH DE number 4027797
Cites work
- A new proof of Szemerédi's theorem
- Additive combinatorics
- An arithmetic regularity lemma, an associated counting lemma, and applications
- Covering the cube by affine hyperplanes
- Finite field models in arithmetic combinatorics -- ten years on
- General systems of linear forms: equidistribution and true complexity
- Good bounds in certain systems of true complexity one
- Linear equations in primes
- Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
- Linear forms and quadratic uniformity for functions on \(\mathbb F^n_p\)
- Linear forms and quadratic uniformity for functions on \(\mathbb{Z}_{N}\)
- Notes on nilspaces: algebraic aspects
- Punctured combinatorial Nullstellensätze
- The inverse conjecture for the Gowers norm over finite fields in low characteristic
- The true complexity of a system of linear equations
Cited in
(5)
This page was built for publication: A refinement of Cauchy-Schwarz complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674565)
