当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
On a simple hard variant of Not-All-Equal 3-Sat
Theoretical Computer Science ( IF 0.747 ) 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-11

 

全部期刊列表>>
物理学研究前沿热点精选期刊推荐
chemistry
《自然》编辑与您分享如何成为优质审稿人-信息流
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
自然职场线上招聘会
ACS ES&T Engineering
ACS ES&T Water
ACS Publications填问卷
屿渡论文,编辑服务
阿拉丁试剂right
南昌大学
王辉
南方科技大学
刘天飞
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
X-MOL
苏州大学
廖矿标
深圳湾
试剂库存
down
wechat
bug