A Hike in the Phases of the 1-in-3 Satisfiability

Elitza N. Maneva,Talya Meltzer,Jack Raymond,Andrea Sportiello,Lenka Zdeborová

Clinical Orthopaedics and Related Research（2007）

引用 24|浏览24

暂无评分

摘要

We summarise our results for the random $\epsilon$--1-in-3 satisfiability problem, where $\epsilon$ is a probability of negation of the variable. We employ both rigorous and heuristic methods to describe the SAT/UNSAT and Hard/Easy transitions.

查看译文

关键词

satisfiability,statistical mechanics,computational complexity,neural network

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要