The complexity of approximating bounded-degree Boolean #CSP-Reference-Cited by-同舟云学术

The complexity of approximating bounded-degree Boolean #CSP

Published:2012-11 Issue: Volume:220-221 Page:1-14
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Dyer Martin,Goldberg Leslie Ann,Jalsenius Markus,Richerby David

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference44 articles.

1. On the approximation complexity hierarchy;Bordewich,2011

2. R. Bubley, M.E. Dyer, Graph orientations with no sink and an approximation for a hard case of #SAT, in: 8th ACM–SIAM Symp. on Discrete Algorithms (SODA 1997), 1997, pp. 248–257.

3. A dichotomy theorem for constraint satisfaction problems on a 3-element domain;Bulatov;J. ACM,2006

4. The complexity of the counting constraint satisfaction problem;Bulatov,2008

5. A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights;Cai,2010

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

1. Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended abstract);2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Zero-freeness and approximation of real Boolean Holant problems;Theoretical Computer Science;2022-05

3. Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems;Journal of Computer and System Sciences;2021-02

4. The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs;Information and Computation;2016-12

5. FPTAS for #BIS with Degree Bounds on One Side;Proceedings of the forty-seventh annual ACM symposium on Theory of Computing;2015-06-14