登录 注册 会员服务 联系我们

The complexity of planar Boolean #CSP with complex weights

  • Published:2020-02 Issue: Volume:107 Page:1-27
  • ISSN:0022-0000
  • Container-title:Journal of Computer and System Sciences
  • language:en
  • Short-container-title:Journal of Computer and System Sciences

Author:

Guo Heng,Williams Tyson

Funder

National Science Foundation

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference57 articles.

1. Exactly Solved Models in Statistical Mechanics;Baxter,1982

2. The Tutte polynomial and its applications;Brylawski,1992

3. The complexity of weighted Boolean #CSP with mixed signs;Bulatov;Theor. Comput. Sci.,2009

4. The complexity of partition functions;Bulatov;Theor. Comput. Sci.,2005

5. Towards a dichotomy theorem for the counting constraint satisfaction problem;Bulatov;Inf. Comput.,2007

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Planar #CSP Equality Corresponds to Quantum Isomorphism – A Holant Viewpoint;ACM Transactions on Computation Theory;2024-09-10

2. The Complexity of Counting Planar Graph Homomorphisms of Domain Size 3;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory;computational complexity;2023-05-17

4. Holographic Algorithms on Domains of General Size;Theory of Computing Systems;2022-07-01

5. FKT is Not Universal — A Planar Holant Dichotomy for Symmetric Constraints;Theory of Computing Systems;2021-08-09
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3