Fetching the paper…
Reading the bibliography…
Chernoff bound is a fundamental tool in theoretical computer science.
Über dyadische bruche
A Khiintchine · 1923
Earlier work this paper cites.
On a modification of chebyshev’s inequality and of the error formula of laplace
Sergei Bernstein · 1924
Earlier work this paper cites.
On the number of real roots of a random algebraic equation (iii)
John Edensor Littlewood and Albert Cyril Offord · 1943
Earlier work this paper cites.
On a lemma of littlewood and offord
Paul Erdös · 1945
Earlier work this paper cites.
Linear hyperbolic partial differential equations with constant coefficients
Lars Gårding · 1951
Earlier work this paper cites.
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
Herman Chernoff · 1952
Earlier work this paper cites.
Differential equations, difference equations and matrix theory
Peter D Lax · 1957
Earlier work this paper cites.
An inequality for hyperbolic polynomials
Lars Gårding · 1959
Earlier work this paper cites.
Extensions of pure states
Richard V Kadison and Isadore M Singer · 1959
Earlier work this paper cites.
Sur les sommes vectorielles sigma plus minus un
Jean-Pierre Kahane · 1964
Earlier work this paper cites.
Lower bounds for the helmholtz function
Sidney Golden · 1965
Earlier work this paper cites.
Inequality with applications in statistical mechanics
Colin J Thompson · 1965
Earlier work this paper cites.
The moduli of smoothness and convexity and the rademacher averages of the trace classes s p ( 1 ≤ p < ∞ ) s_{p}(1\leq p<\infty)
Nicole Tomczak-Jaegermann · 1974
Earlier work this paper cites.
The analysis of linear partial differential operators ii
L Hormander · 1983
Earlier work this paper cites.
Six standard deviations suffice
Joel Spencer · 1985
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1994
Earlier work this paper cites.
On the best constant in the khinchin-kahane inequality
Rafał Latała and Krzysztof Oleszkiewicz · 1994
Earlier work this paper cites.
On the general notion of fully nonlinear second-order elliptic equations
N.V. Krylov · 1995
Earlier work this paper cites.
Randomized algorithms
Rajeev Motwani and Prabhakar Raghavan · 1995
Earlier work this paper cites.
Hyperbolic polynomials and interior point methods for convex programming
Osman Güler · 1997
Earlier work this paper cites.
Random vectors in the isotropic position
Mark Rudelson · 1999
Earlier work this paper cites.
Hyperbolic polynomials and convex analysis
Heinz H Bauschke, Osman Güler, Adrian S Lewis, and Hristo S Sendov · 2001
Earlier work this paper cites.
Strong converse for identification via quantum channels
Rudolf Ahlswede and Andreas Winter · 2002
Earlier work this paper cites.
Trigonometric series
Antoni Zygmund · 2002
Earlier work this paper cites.
Combinatorics hidden in hyperbolic polynomials and related topics
Leonid Gurvits · 2004
Earlier work this paper cites.
The lax conjecture is true
Adrian Lewis, Pablo Parrilo, and Motakuri Ramana · 2005
Earlier work this paper cites.
Random symmetric matrices are almost surely nonsingular
Kevin P Costello, Terence Tao, and Van Vu · 2006
Earlier work this paper cites.
Hyperbolic polynomials approach to van der waerden/schrijver-valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications
Leonid Gurvits · 2006
Earlier work this paper cites.
Estimates of moments and tails of gaussian chaoses
Rafał Latała · 2006
Earlier work this paper cites.
Hyperbolic programs, and their derivative relaxations
James Renegar · 2006
Earlier work this paper cites.
Leonid Gurvits · 2007
Earlier work this paper cites.
Linear matrix inequality representation of sets
J William Helton and Victor Vinnikov · 2007
Earlier work this paper cites.
Sampling from large matrices: An approach through geometric functional analysis
Mark Rudelson and Roman Vershynin · 2007
Cited alongside, same era.
Geometric discrepancy: An illustrated guide
Jiri Matousek · 2009
Cited alongside, same era.
Concentration of the adjacency matrix and of the laplacian in random graphs with independent edges
Roberto Imbuzeiro Oliveira · 2009
Cited alongside, same era.
Constructive algorithms for discrepancy minimization
Nikhil Bansal · 2010
Cited alongside, same era.
Moments of the gaussian chaos
Joseph Lehec · 2011
Cited alongside, same era.
Tail and moment estimates for chaoses generated by symmetric random variables with logarithmically concave tails
Radosław Adamczak and Rafał Latała · 2012
Anti-concentration for polynomials of independent random variables
Raghu Meka, Oanh Nguyen, and Van Vu · 2017
Later among the works it cites.
Constructive discrepancy minimization for convex sets
Thomas Rothvoss · 2017
Later among the works it cites.
The gram-schmidt walk: a cure for the banaszczyk blues
Nikhil Bansal, Daniel Dadush, Shashwat Garg, and Shachar Lovett · 2018
Later among the works it cites.
Hyperbolic polynomials and the Kadison-Singer problem
Petter Brändén · 2018
Later among the works it cites.
Balancing vectors in any norm
Daniel Dadush, Aleksandar Nikolov, Kunal Talwar, and Nicole Tomczak-Jaegermann · 2018
Later among the works it cites.
Efficient algorithms for discrepancy minimization in convex sets
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
Joel A Tropp · 2012
Cited alongside, same era.
Probability in Banach Spaces: isoperimetry and processes
Michel Ledoux and Michel Talagrand · 2013
Cited alongside, same era.
Pseudorandom generators for polynomial threshold functions
Raghu Meka and David Zuckerman · 2013
Cited alongside, same era.
Hanson-wright inequality and sub-gaussian concentration
Mark Rudelson and Roman Vershynin · 2013
Cited alongside, same era.
The kadison-singer problem for strongly rayleigh measures and applications to asymmetric tsp
Nima Anari and Shayan Oveis Gharan · 2014
Cited alongside, same era.
Smoothed analysis of tensor decompositions
Aditya Bhaskara, Moses Charikar, Ankur Moitra, and Aravindan Vijayaraghavan · 2014
Cited alongside, same era.
Ronen Eldan and Mohit Singh · 2018
Later among the works it cites.
A matrix expander chernoff bound
Ankit Garg, Yin-Tat Lee, Zhao Song, and Nikhil Srivastava · 2018
Later among the works it cites.
Rasmus Kyng and Zhao Song · 2018
Later among the works it cites.
Interlacing families IV: Bipartite ramanujan graphs of all sizes
Adam W Marcus, Daniel A Spielman, and Nikhil Srivastava · 2018
Later among the works it cites.
Symbolic computation in hyperbolic programming
Simone Naldi and Daniel Plaumann · 2018
Later among the works it cites.
A spectrahedral representation of the first derivative relaxation of the positive semidefinite cone
James Saunderson · 2018
Later among the works it cites.
Second-order matrix concentration inequalities
Joel A Tropp · 2018
Later among the works it cites.
Spectrahedrality of hyperbolicity cones of multivariate matching polynomials
Nima Amini · 2019
Later among the works it cites.
Fooling polytopes
Ryan O’Donnell, Rocco A Servedio, and Li-Yang Tan · 2019
Later among the works it cites.
Accelerated first-order methods for hyperbolic programming
James Renegar · 2019
Later among the works it cites.
Personal communication, 2019
James Renegar · 2019
Later among the works it cites.
Exponential lower bounds on spectrahedral representations of hyperbolicity cones
Prasad Raghavendra, Nick Ryder, Nikhil Srivastava, and Benjamin Weitz · 2019
Later among the works it cites.
Certifying polynomial nonnegativity via hyperbolic optimization
James Saunderson · 2019
Later among the works it cites.
Paving property for real stable polynomials and strongly rayleigh processes
Kasra Alishahi and Milad Barzegar · 2020
Closest in time.
Matrix Poincaré inequalities and concentration
Richard Aoun, Marwa Banna, and Pierre Youssef · 2020
Closest in time.
Reducing isotropy and volume to KLS: An O ∗ ( n 3 ψ 2 ) O^{*}(n^{3}\psi^{2}) volume algorithm
He Jia, Aditi Laddha, Yin Tat Lee, and Santosh S Vempala · 2020
Closest in time.
Four deviations suffice for rank 1 matrices
Rasmus Kyng, Kyle Luh, and Zhao Song · 2020
Closest in time.
A spectral approach to network design
Lap Chi Lau and Hong Zhou · 2020
Closest in time.
Concentration of markov chains with bounded moments
Assaf Naor, Shravas Rao, and Oded Regev · 2020
Closest in time.
Vector balancing in lebesgue spaces
Victor Reis and Thomas Rothvoss · 2020
Closest in time.
Concentration inequalities for random tensors
Roman Vershynin · 2020
Closest in time.
Moments of gaussian chaoses in banach spaces
Radosław Adamczak, Rafał Latała, and Rafał Meller · 2021
Closest in time.
Positive spectrahedrons: Geometric properties, invariance principles and pseudorandom generators
Srinivasan Arunachalam and Penghui Yao · 2021
Closest in time.
A new framework for matrix discrepancy: Partial coloring bounds via mirror descent
Daniel Dadush, Haotian Jiang, and Victor Reis · 2021
Closest in time.
Matrix discrepancy from quantum communication
Samuel B Hopkins, Prasad Raghavendra, and Abhishek Shetty · 2021
Closest in time.
A real stable generalization of Anari, Oveis Gharan and Kyng, Luh, Song
Ruizhe Zhang and Xinzhi Zhang · 2021
Closest in time.