A Full Derandomization Of Schoning'S K-Sat Algorithm

STOC（2011）

引用 88|浏览30

暂无评分

摘要

Schoning [12] presents a simple randomized algorithm for k-SAT with running time a(k)(n) . poly(n) for a(k) = 2(k - 1)/k. We give a deterministic version of this algorithm running in time a(k)(n+o(n)).

查看译文

关键词

Schoning's algorithm,derandomization,SAT,k-SAT

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要