Six Standard Deviations Suffice

From MaRDI portal
Publication:3698810

DOI10.2307/2000258zbMath0577.05018OpenAlexW4255414226WikidataQ56456691 ScholiaQ56456691MaRDI QIDQ3698810

J. H. Spencer

Publication date: 1985

Full work available at URL: https://doi.org/10.2307/2000258



Related Items

Balancing vectors in the max norm, The set splittability problem, Small subset sums, On series of signed vectors and their rearrangements, Sparse recovery properties of discrete random matrices, Randomization, derandomization and antirandomization: Three games, Discrepancy of set-systems and matrices, Typical rounding problems, Constructive Discrepancy Minimization by Walking on the Edges, The probabilistic method yields deterministic parallel algorithms, Probabilistic methods, Quasi‐random 2‐ colorings of point sets, From Erdős to algorithms, The smallest n-uniform hypergraph with positive discrepancy, Tight upper bounds for the discrepancy of half-spaces, On the \(L_{2}\)-discrepancy, Lattice coverings and Gaussian measures of \(n\)-dimensional convex bodies, On a conjecture of Kömlos about signed sums of vectors inside the sphere, Approximation-Friendly Discrepancy Rounding, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Almost envy-freeness for groups: improved bounds via discrepancy theory, Unnamed Item, Improved upper bounds for approximation by zonotopes, Probabilistic existence of regular combinatorial structures, On Polynomials with Low Peak Signal to Power (L to L 2 Norm) Ratios and Theorems of Kashin and Spencer, A note on norms of signed sums of vectors, Chowla's cosine problem, Quantum discrepancy: a non-commutative version of combinatorial discrepancy, Algorithmic pure states for the negative spherical perceptron, Sidonicity and variants of Kaczmarz's problem, The discrepancy of random rectangular matrices, Vector balancing in Lebesgue spaces, Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs, Algorithmic obstructions in the random number partitioning problem, Luzin's problem on Fourier convergence and homeomorphisms, Norms of weighted sums of log-concave random vectors, Critical window of the symmetric perceptron, Homeomorphisms and Fourier expansion, Discrepancy theory and related algorithms, On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems, Siegel’s Lemma Is Sharp, Constructive Discrepancy Minimization for Convex Sets, A remark on Kashin's discrepancy argument and partial coloring in the Komlós conjecture, An Improvement of the Beck–Fiala Theorem, Discrepancy in arithmetic progressions, Maximizing coverage while ensuring fairness: a tale of conflicting objectives, Four deviations suffice for rank 1 matrices, Flat Littlewood polynomials exist, Coloring the projective plane, The cycle discrepancy of three-regular graphs, An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound, Asymptotically optimal Boolean functions, A note on the discrepancy of matrices with bounded row and column sums, Growing balanced covering sets, Selectively balancing unit vectors, On Nonnegative Cosine Polynomials with Nonnegative Integral Coefficients, Integer programming in VLSI design, The convexification effect of Minkowski summation, A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension, Discrepancy, chaining and subgaussian processes, Highly nonlinear functions, Deterministic discrepancy minimization, Discrepancy and signed domination in graphs and hypergraphs, Semidefinite optimization in discrepancy theory, Unnamed Item, Better Bin Packing Approximations via Discrepancy Theory, Highly nonlinear functions over finite fields, On‐line balancing of random inputs, A Beck-Fiala-type theorem for Euclidean norms, Gaussian discrepancy: a probabilistic relaxation of vector balancing, Upper and lower bounds for matrix discrepancy, Unnamed Item, Signed domination in regular graphs and set-systems, Unnamed Item, Algorithmic Aspects of Combinatorial Discrepancy, Do flat skew-reciprocal Littlewood polynomials exist?, The Complexity of Differential Privacy, Lacunary sets and function spaces with finite cotype, The remote set problem on lattices



Cites Work