Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about the disproof of the Generalised Linial-Nisan Conjecture for DNFs (Disjunctive Normal Forms) in this 13-minute conference talk by Yaroslav Alekseev from the Fields Institute. Explore the collaborative research findings that challenge this fundamental conjecture in computational complexity theory, presented as joint work with Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, and Weiqiang Yuan. Discover the mathematical techniques and counterexamples used to demonstrate the falsity of this generalized version of the classical Linial-Nisan conjecture when applied to DNF formulas, contributing to our understanding of the limitations of certain complexity-theoretic assumptions in Boolean function analysis.
