Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #1 to TR22-030 | 1st March 2022 15:14

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

RSS-Feed




Revision #1
Authors: Aniruddha Biswas, Palash Sarkar
Accepted on: 1st March 2022 15:14
Downloads: 101
Keywords: 


Abstract:

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


Paper:

TR22-030 | 18th February 2022 07:23

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


Abstract:

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



ISSN 1433-8092 | Imprint