Nearly all k-SAT Functions are Unate
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=3qO66qkVTlo
Yufei Zhao (Massachusetts Institute of Technology)
https://simons.berkeley.edu/talks/yufei-zhao-massachusetts-institute-technology-2023-07-24
Structural Results
We prove that 1-o(1) fraction of all k-SAT functions on n Boolean variables are unate (i.e., monotone after first negating some variables), for any fixed positive integer k. This resolves a conjecture by Bollobás, Brightwell, and Leader from 2003. (Joint work with József Balogh, Dingding Dong, Bernard Lidický, and Nitya Mani).
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Structural Results
Yufei Zhao