1.0957-Approximation Algorithm for Random MAX-3SAT
RAIRO-OPERATIONS RESEARCH（2007）
摘要
We prove that MAX-3SAT can be approximated in polynomial time within a factor 1.0957 on random instances.
更多查看译文
关键词
random satisfiability,approximate algorithms
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要