An improved upper bound for the most informative boolean function conjecture - researchr publication

researchr

You are not signed in
Sign in
Sign up

Or Ordentlich, Ofer Shayevitz, Omri Weinstein. An improved upper bound for the most informative boolean function conjecture. In IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, July 10-15, 2016. pages 500-504, IEEE, 2016. [doi]

Abstract is missing.

runs on WebDSL