Nearly all k-SAT Functions are Unate

Published on ● Video Link: https://www.youtube.com/watch?v=3qO66qkVTlo



Duration: 1:04:40
773 views
11


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).







Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Structural Results
Yufei Zhao