Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin

@article{Backens2020BooleanAC,
  title={Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin},
  author={Miriam Backens and Andrei Bulatov and Leslie Ann Goldberg and Colin McQuillan and Stanislav Zivny},
  journal={J. Comput. Syst. Sci.},
  year={2020},
  volume={109},
  pages={95-125}
}
  • Miriam Backens, Andrei Bulatov, +2 authors Stanislav Zivny
  • Published 2020
  • Mathematics, Computer Science
  • J. Comput. Syst. Sci.
  • Abstract 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… CONTINUE READING

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-2 OF 2 CITATIONS

    Holant Clones and the Approximability of Conservative Holant Problems

    VIEW 13 EXCERPTS
    CITES METHODS & BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 26 REFERENCES

    An approximation trichotomy for Boolean #CSP

    VIEW 3 EXCERPTS

    The complexity of complex weighted Boolean #CSP

    VIEW 1 EXCERPT

    The complexity of approximating conservative counting CSPs

    VIEW 2 EXCERPTS

    The Complexity of Weighted Boolean #CSP

    VIEW 4 EXCERPTS

    From Holant to #CSP and Back: Dichotomy for Holantc Problems

    VIEW 3 EXCERPTS

    The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs

    • Allan Sly, Nike Sun
    • Mathematics, Computer Science, Physics
    • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
    • 2012
    VIEW 2 EXCERPTS