Joel Spencer

Suggest Changes
Learn More
Given n sets on n elements it is shown that there exists a two-coloring such that all sets have discrepancy at most Kn>/2, K an absolute constant. This improves the basic probabilistic method with(More)