A complete dichotomy rises from the capture of vanishing signatures: extended abstract

@inproceedings{Cai2013ACD,
  title={A complete dichotomy rises from the capture of vanishing signatures: extended abstract},
  author={J. Cai and Heng Guo and Tyson Williams},
  booktitle={STOC '13},
  year={2013}
}
  • J. Cai, Heng Guo, Tyson Williams
  • Published in STOC '13 2013
  • Computer Science, Mathematics
  • We prove a complexity dichotomy theorem for Holant problems over an arbitrary set of complex-valued symmetric constraint functions {F} on Boolean variables. This extends and unifies all previous dichotomies for Holant problems on symmetric constraint functions (taking values without a finite modulus). We define and characterize all symmetric vanishing signatures. They turned out to be essential to the complete classification of Holant problems. The dichotomy theorem has an explicit tractability… CONTINUE READING
    A Complete Dichotomy Rises from the Capture of Vanishing Signatures
    • 41
    • PDF
    A Dichotomy for Real Weighted Holant Problems
    • 37
    • PDF
    The Complexity of Planar Boolean #CSP with Complex Weights
    • 25
    • PDF
    A Holant Dichotomy: Is the FKT Algorithm Universal?
    • 18
    • PDF
    A Simple FPTAS for Counting Edge Covers
    • 29
    • PDF
    The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems
    • 12
    • PDF
    A complete dichotomy for complex-valued Holant^c
    • 11
    • Highly Influenced
    • PDF
    FPTAS for Weighted Fibonacci Gates and Its Applications
    • 14
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES
    The complexity of partition functions
    • 166
    • Highly Influential
    • PDF
    A Dichotomy for Real Weighted Holant Problems
    • 37
    • Highly Influential
    • PDF