Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width
From MaRDI portal
Publication:713329
Recommendations
Cites work
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- A probabilistic approach to problems parameterized above or below tight bounds
- Algorithms with large domination ratio
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
- Improved bounds on Bell numbers and on moments of sums of random variables
- Noise stability of functions with low influences: invariance and optimality
- On the advantage over a random assignment
- Parameterizing above or below guaranteed values
- Parametrized complexity theory.
- Proof of a hypercontractive estimate via entropy
- Pseudo-Boolean optimization
- Simultaneously satisfying linear equations over \(\mathbb {F}_2\): MaxLin2 and Max-\(r\)-Lin2 parameterized above average
- Solving MAX-\(r\)-SAT above a tight lower bound
- Some optimal inapproximability results
- Systems of linear equations over \(\mathbb{F}_2\) and problems parameterized above average
Cited in
(3)
This page was built for publication: Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713329)