Five Proofs of Chernoff's Bound with Applications

01/10/2018
by   Wolfgang Mulzer, et al.
0

We discuss five ways of proving Chernoff's bound and show how they lead to different extensions of the basic bound.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2019

Beyond Natural Proofs: Hardness Magnification and Locality

Hardness magnification reduces major complexity separations (such as EXP...
research
03/27/2023

A simplified lower bound for implicational logic

We present a streamlined and simplified exponential lower bound on the l...
research
04/20/2023

On a Sharp Estimate of Overlapping Schwarz Methods in H(curl;Ω) and H(div;Ω)

The previous proved-bound is C(1+H^2/δ^2) for the condition number of th...
research
12/23/2021

A Point-free Perspective on Lax extensions and Predicate liftings

In this paper we have a fresh look at the connection between lax extensi...
research
05/02/2022

A Critique of Uribe's "P vs. NP"

In this critique, we examine the technical report by Daniel Uribe entitl...
research
03/15/2022

Performance Comparison of Python Translators for a Multi-threaded CPU-bound Application

Currently, Python is one of the most widely used languages in various ap...
research
04/27/2017

No, This is not a Circle

A popular curve shown in introductory maths textbooks, seems like a circ...

Please sign up or login with your details

Forgot password? Click here to reset