当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
On a simple hard variant of Not-All-Equal 3-Sat
Theoretical Computer Science ( IF 0.718 ) Pub Date : 2020-02-11 , DOI: 10.1016/j.tcs.2020.02.010
Andreas Darmann; Janosch Döcker

We consider a simplified version of Not-All-Equal 3-Sat, a variation of the famous Satisfiability problem, where each clause is made up of exactly three distinct literals and the question is whether there exists a truth assignment such that for each clause at least one literal is set to true and at least one is set to false. We show that Not-All-Equal 3-Sat remains NP-complete if (1) each variable appears exactly four times, (2) there are no negations in the formula, and (3) the formula is linear, i.e., each pair of distinct clauses shares at most one variable. Therewith, we improve upon two results in the literature.
更新日期:2020-02-12

 

全部期刊列表>>
化学/材料学中国作者研究精选
ACS材料视界
南京大学
自然科研论文编辑服务
剑桥大学-
中国科学院大学化学科学学院
南开大学化学院周其林
课题组网站
X-MOL
北京大学分子工程苏南研究院
华东师范大学分子机器及功能材料
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug