当前位置: X-MOL 学术J. Comput. Syst. Sci. › 论文详情
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
Journal of Computer and System Sciences ( IF 1.494 ) Pub Date : 2019-12-27 , DOI: 10.1016/j.jcss.2019.12.003
Miriam Backens; Andrei Bulatov; Leslie Ann Goldberg; Colin McQuillan; Stanislav Živný

We analyse the complexity of approximate counting constraint satisfactions problems #CSP(F), where F is a set of nonnegative rational-valued functions of Boolean variables. A complete classification is known if F contains arbitrary unary functions. We strengthen this result by fixing any permissive strictly increasing unary function and any permissive strictly decreasing unary function, and requiring only those to be in F. The resulting classification is employed to characterise the complexity of a wide range of two-spin problems, fully classifying the ferromagnetic case. Furthermore, we also consider what happens if only the pinning functions are assumed to be in F. We show that any set of functions for which pinning is not sufficient to recover the two kinds of permissive unaries must either have a very simple range, or must satisfy a certain monotonicity condition. We exhibit a non-trivial example of a set of functions satisfying the monotonicity condition.
更新日期:2020-01-04

 

全部期刊列表>>
胸部和胸部成像专题
自然科研论文编辑服务
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
鲁照永
华东师范大学
苏州大学
南京工业大学
南开大学
中科大
唐勇
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
广东实验室
南京大学
王杰
南科大
刘尊峰
湖南大学
清华大学
王小野
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug