Complexity Dichotomies for Counting Problems
Latest Publications

TOTAL DOCUMENTS

12

(FIVE YEARS 0)

H-INDEX

0

(FIVE YEARS 0)

Published By Cambridge University Press

9781107062375, 9781107477063, 9781107635609

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

2-Spin Systems on Regular Graphs

Complexity Dichotomies for Counting Problems ◽

10.1017/9781107477063.006 ◽

2017 ◽

pp. 145-201

Keyword(s):

Spin Systems ◽

Download Full-text

Matchgates and Holographic Algorithms

Complexity Dichotomies for Counting Problems ◽

10.1017/9781107477063.005 ◽

2017 ◽

pp. 98-144

Keyword(s):

Holographic Algorithms

Download Full-text

Counting Problems

Complexity Dichotomies for Counting Problems ◽

10.1017/9781107477063.002 ◽

2017 ◽

pp. 1-34

Keyword(s):

Counting Problems

Download Full-text

Planar Holant for Symmetric Constraints

Complexity Dichotomies for Counting Problems ◽

10.1017/9781107477063.010 ◽

2017 ◽

pp. 362-406

Download Full-text

Dichotomies for Asymmetric Constraints

Complexity Dichotomies for Counting Problems ◽

10.1017/9781107477063.011 ◽

2017 ◽

pp. 407-450

Download Full-text

Bibliography

Complexity Dichotomies for Counting Problems ◽

10.1017/9781107477063.012 ◽

2017 ◽

pp. 451-458

Download Full-text

Holant Dichotomy for Symmetric Constraints

Complexity Dichotomies for Counting Problems ◽

10.1017/9781107477063.008 ◽

2017 ◽

pp. 256-327

Download Full-text

Fibonacci Gates and Holant* Problems

Complexity Dichotomies for Counting Problems ◽

10.1017/9781107477063.003 ◽

2017 ◽

pp. 35-65

Keyword(s):

Holant Problems

Download Full-text

Holant Problems and #CSP

Complexity Dichotomies for Counting Problems ◽

10.1017/9781107477063.007 ◽

2017 ◽

pp. 202-255

Keyword(s):

Holant Problems

Download Full-text

Boolean #CSP

Complexity Dichotomies for Counting Problems ◽

10.1017/9781107477063.004 ◽

2017 ◽

pp. 66-97

Download Full-text