Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ANUPA SUNNY:
All reports by Author Anupa Sunny:

TR20-002 | 6th January 2020
Sophie Laplante, Reza Naserasr, Anupa Sunny

Sensitivity lower bounds from linear dependencies

Recently, using spectral techniques, H. Huang proved that every subgraph of the hypercube of dimension n induced on more than half the vertices has maximum degree at least the square root of n. Combined with some earlier work, this completed a proof of the sensitivity conjecture. In this work we ... more >>>




ISSN 1433-8092 | Imprint