Complexity Classification of the Eight-Vertex Model

Ahlfors, L., Complex Analysis, 3 ed. (McGraw-Hill, 1979)

1979

Earlier work this paper cites.

Michel Las Vergnas: On the evaluation at (3, 3) of the Tutte polynomial of a graph. J. Comb. Theory, Ser. B 45(3): 367-372 (1988)

1988

Earlier work this paper cites.

Martin E. Dyer, Catherine S. Greenhill: The complexity of counting graph homomorphisms. Random Struct. Algorithms 17(3-4): 260-289 (2000)

2000

Earlier work this paper cites.

Andrei A. Bulatov, Martin Grohe: The complexity of partition functions. Theor. Comput. Sci. 348(2-3): 148-186 (2005)

2005

Earlier work this paper cites.

A. A. Bulatov and V. Dalmau, Towards a dichotomy theorem for the counting constraint satisfaction problem, Inform. and Comput., 205 (2007), pp. 651–678

2007

Earlier work this paper cites.

Andrei A. Bulatov: The Complexity of the Counting Constraint Satisfaction Problem. ICALP (1) 2008: 646-661

2008

Earlier work this paper cites.

Leslie G. Valiant: Holographic Algorithms. SIAM J. Comput. 37(5): 1565-1594 (2008)

2008

Earlier work this paper cites.

Jin-Yi Cai, Xi Chen, Richard J. Lipton, and Pinyan Lu. On tractable exponential sums. In FAW, pages 148-159. Springer Berlin Heidelberg, 2010

2010

Earlier work this paper cites.

Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley: A Complexity Dichotomy for Partition Functions with Mixed Signs. SIAM J. Comput. 39(7): 3336-3402 (2010)

2010

Cited alongside, same era.

A. Bulatov, M. Dyer, L. A. Goldberg, M. Jalsenius, M. Jerrum, and D. Richerby, The complexity of weighted and unweighted #CSP, J. Comput. System Sci., 78 (2012), pp. 681–688

2012

Cited alongside, same era.

Jin-Yi Cai, Xi Chen: Complexity of counting CSP with complex weights. STOC 2012: 909-920

2012

Cited alongside, same era.

Jin-Yi Cai, Sangxia Huang, Pinyan Lu: From Holant to #CSP and Back: Dichotomy for Holant c Problems. Algorithmica 64(3): 511-533 (2012)

2012

Cited alongside, same era.

Jin-Yi Cai, Xi Chen, Pinyan Lu: Graph Homomorphisms with Complex Values: A Dichotomy Theorem. SIAM J. Comput. 42(3): 924-1029 (2013)

2013

Martin E. Dyer, David Richerby: An Effective Dichotomy for the Counting Constraint Satisfaction Problem. SIAM J. Comput. 42(3): 1245-1274 (2013)

2013

Later among the works it cites.

Jin-Yi Cai, Pinyan Lu, Mingji Xia: The complexity of complex weighted Boolean #CSP. J. Comput. Syst. Sci. 80(1): 217-236 (2014)

2014

Later among the works it cites.

Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams: A Holant Dichotomy: Is the FKT Algorithm Universal? FOCS 2015: 1259-1276

2015

Later among the works it cites.

Jin-Yi Cai, Xi Chen, Pinyan Lu: Nonnegative Weighted #CSP: An Effective Complexity Dichotomy. SIAM J. Comput. 45(6): 2177-2198 (2016)

2016

Later among the works it cites.

Jin-Yi Cai, Zhiguo Fu: Holographic Algorithm with Matchgates Is Universal for Planar # \# CSP Over Boolean Domain. CoRR abs/1603.07046 (2016)

Original

2016