check
An improved upper bound for the most informative boolean function conjecture | Omri Weinstein

An improved upper bound for the most informative boolean function conjecture