2 papers
cs.CC2020
Tight Chang's-lemma-type bounds for Boolean functions
Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal +3
Chang's lemma (Duke Mathematical Journal, 2002) is a classical result with applications across several areas in mathematics and computer science. For a Boolean function that ta…
cs.CC2018
On the Probabilistic Degree of OR over the Reals
Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli +1
We study the probabilistic degree over reals of the OR function on variables. For an error parameter in (0,1/3), the -error probabilistic degree of any Boolean function…