Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > PALASH SARKAR:
All reports by Author Palash Sarkar:

TR22-180 | 15th December 2022
Aniruddha Biswas, Palash Sarkar

A Lower Bound on the Constant in the Fourier Min-Entropy/Influence Conjecture

Revisions: 1

We describe a new construction of Boolean functions. A specific instance of our construction provides a 30-variable Boolean function having min-entropy/influence ratio to be 128/45 ? 2.8444 which is presently the highest known value of this ratio that is achieved by any Boolean function. Correspondingly, 128/45 is also presently the ... more >>>


TR22-030 | 18th February 2022
Aniruddha Biswas, Palash Sarkar

On The ''Majority is Least Stable'' Conjecture.

Revisions: 1

We show that the ''majority is least stable'' conjecture is true for $n=1$ and $3$ and false for all odd $n\geq 5$.

more >>>

TR21-111 | 19th July 2021
Aniruddha Biswas, Palash Sarkar

Influence of a Set of Variables on a Boolean Function

Revisions: 2

The influence of a set of variables on a Boolean function has three separate definitions in the literature, the first due to Ben-Or and Linial (1989), the second due to Fischer et al. (2002) and Blais (2009) and the third due to Tal (2017). The goal of the present work ... more >>>




ISSN 1433-8092 | Imprint