On the resolution of the sensitivity conjecture

Autor:	Karthikeyan, Rohan, Sinha, Siddharth, Patil, Vallabh
Rok vydání:	2019
Předmět:	Mathematics - Combinatorics Computer Science - Computational Complexity 68R10 05C35 05-02 (Primary) 68Q17 94C10 41A10 42A16 05E05 15A24 (Secondary)
Zdroj:	Bull. Amer. Math. Soc. 57 (2020), 615-638
Druh dokumentu:	Working Paper
DOI:	10.1090/bull/1697
Popis:	The Sensitivity Conjecture is a long-standing problem in theoretical computer science that seeks to fit the sensitivity of a Boolean function into a unified framework formed by the other complexity measures of Boolean functions, such as block sensitivity and certificate complexity. After more than thirty years of attacks on this Conjecture, Hao Huang (2019) gave a very succinct proof of the Conjecture. In this survey, we explore the ideas that inspired the proof of this Conjecture by an exposition of four papers that had the most impact on the Conjecture. We also discuss progress on further research directions that the Conjecture leads us to. Comment: 25 pages; added new section on open problems, typos corrected, submitted for publication
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1912.05406 Zobrazit plný text záznamu View this record from Arxiv