Hypercontractivity via tensor calculus
From MaRDI portal
Cites work
- A Remarkable Series of Orthogonal Functions (I)
- Analysis of Boolean Functions
- Comparison of moments of Rademacher chaoses
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Ensembles (p) dans le dual de D^
- Generalized Frobenius inner products
- scientific article; zbMATH DE number 6351506 (Why is no real title available?)
- scientific article; zbMATH DE number 2117212 (Why is no real title available?)
- Hypercontractivity, sum-of-squares proofs, and their applications
- Improved bounds on sample size for implicit matrix trace estimators
- Learning Monotone Decision Trees in Polynomial Time
- Logarithmic Sobolev Inequalities
- On variants of the Johnson–Lindenstrauss lemma
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Proof of a hypercontractive estimate via entropy
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- Sharp thresholds of graph properties, and the k-sat problem
- Some applications of hypercontractive inequalities in quantum information theory
- Tensor spaces and numerical tensor calculus
- The Frobenius norm and the commutator
- Zero knowledge and the chromatic number
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
Cited in
(1)
This page was built for publication: Hypercontractivity via tensor calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695312)
