FKT is Not Universal — A Planar Holant Dichotomy for Symmetric Constraints
Published 2021 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
FKT is Not Universal — A Planar Holant Dichotomy
for Symmetric Constraints
Authors
Keywords
-
Journal
THEORY OF COMPUTING SYSTEMS
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2021-08-09
DOI
10.1007/s00224-021-10032-1
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Dichotomy for Holant∗ Problems on the Boolean Domain
- (2020) Jin-Yi Cai et al. THEORY OF COMPUTING SYSTEMS
- Holographic Algorithm with Matchgates Is Universal for Planar #CSP over Boolean Domain
- (2019) Jin-Yi Cai et al. SIAM JOURNAL ON COMPUTING
- The complexity of planar Boolean #CSP with complex weights
- (2019) Heng Guo et al. JOURNAL OF COMPUTER AND SYSTEM SCIENCES
- Holographic algorithms beyond matchgates
- (2018) Jin-Yi Cai et al. INFORMATION AND COMPUTATION
- The Complexity of Boolean Holant Problems with Nonnegative Weights
- (2018) Jiabao Lin et al. SIAM JOURNAL ON COMPUTING
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
- (2017) Jin-Yi Cai et al. SIAM JOURNAL ON COMPUTING
- Polynomial-time solvable #CSP problems via algebraic models and Pfaffian circuits
- (2016) S. Margulies et al. JOURNAL OF SYMBOLIC COMPUTATION
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures
- (2016) Jin-Yi Cai et al. SIAM JOURNAL ON COMPUTING
- A Dichotomy for Real Weighted Holant Problems
- (2015) Sangxia Huang et al. COMPUTATIONAL COMPLEXITY
- Characterizing partition functions of the spin model by rank growth
- (2013) Alexander Schrijver INDAGATIONES MATHEMATICAE-NEW SERIES
- The complexity of complex weighted Boolean #CSP
- (2013) Jin-Yi Cai et al. JOURNAL OF COMPUTER AND SYSTEM SCIENCES
- The Complexity of Symmetric Boolean Parity Holant Problems
- (2013) Heng Guo et al. SIAM JOURNAL ON COMPUTING
- Holographic algorithms without matchgates
- (2012) J.M. Landsberg et al. LINEAR ALGEBRA AND ITS APPLICATIONS
- Spin systems on k-regular graphs with complex edge functions
- (2012) Jin-Yi Cai et al. THEORETICAL COMPUTER SCIENCE
- Characterizing partition functions of the vertex model
- (2011) Jan Draisma et al. JOURNAL OF ALGEBRA
- Computational Complexity of Holant Problems
- (2011) Jin-Yi Cai et al. SIAM JOURNAL ON COMPUTING
- Holographic algorithms: From art to science
- (2010) Jin-Yi Cai et al. JOURNAL OF COMPUTER AND SYSTEM SCIENCES
- On Symmetric Signatures in Holographic Algorithms
- (2009) Jin-Yi Cai et al. THEORY OF COMPUTING SYSTEMS
- Holographic Algorithms
- (2008) Leslie G. Valiant SIAM JOURNAL ON COMPUTING
Create your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create NowBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started