The Fourth Moment Method

DOI10.1137/S0097539792240005zbMath0885.68080OpenAlexW2077326980WikidataQ57394591 ScholiaQ57394591MaRDI QIDQ4376165

Bonnie Berger

Publication date: 10 February 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539792240005

zbMATH Keywords

set discrepancymaximum acyclic subgraphremoving randomnessGayle--Berlekamp switching game

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Distributed algorithms (68W15)

Related Items (12)

Quasi-random multilinear polynomials ⋮ Low rank matrix recovery from rank one measurements ⋮ Distinguishing multi-partite states by local measurements ⋮ Extremal results on feedback arc sets in digraphs ⋮ Deterministic parallel algorithms for bilinear objective functions ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS ⋮ CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS ⋮ An ODE method to prove the geometric convergence of adaptive stochastic algorithms ⋮ Improved algorithms via approximations of probability distributions ⋮ Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding ⋮ Some applications of hypercontractive inequalities in quantum information theory

This page was built for publication: The Fourth Moment Method