Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
Author:
Achlioptas Dimitris
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Structure of the Boolean Satisfiability Problem: A Survey;ACM Computing Surveys;2022-03-30
2. Chapter 6. Incomplete Algorithms;Frontiers in Artificial Intelligence and Applications;2021-02-02
3. Chapter 1. A History of Satisfiability;Frontiers in Artificial Intelligence and Applications;2021-02-02
4. Super solutions of random (3 + p)-SAT;Theoretical Computer Science;2019-11
5. Minimal sets to destroy the
k
-core in random networks;Physical Review E;2019-02-20