相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。FKT is Not Universal - A Planar Holant Dichotomy for Symmetric Constraints
Jin-Yi Cai et al.
THEORY OF COMPUTING SYSTEMS (2022)
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
Jin-Yi Cai et al.
ACM TRANSACTIONS ON COMPUTATION THEORY (2019)
THE COMPLEXITY OF BOOLEAN HOLANT PROBLEMS WITH NONNEGATIVE WEIGHTS
Jiabao Lin et al.
SIAM JOURNAL ON COMPUTING (2018)
Complexity of Counting CSP with Complex Weights
Jin-Yi Cai et al.
JOURNAL OF THE ACM (2017)
A Dichotomy for Real Weighted Holant Problems
Sangxia Huang et al.
COMPUTATIONAL COMPLEXITY (2016)
A COMPLETE DICHOTOMY RISES FROM THE CAPTURE OF VANISHING SIGNATURES
Jin-Yi Cai et al.
SIAM JOURNAL ON COMPUTING (2016)
NONNEGATIVE WEIGHTED #CSP: AN EFFECTIVE COMPLEXITY DICHOTOMY
Jin-Yi Cai et al.
SIAM JOURNAL ON COMPUTING (2016)
The complexity of complex weighted Boolean #CSP
Jin-Yi Cai et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2014)
Holographic algorithms by Fibonacci gates
Jin-Yi Cai et al.
LINEAR ALGEBRA AND ITS APPLICATIONS (2013)
THE COMPLEXITY OF SYMMETRIC BOOLEAN PARITY HOLANT PROBLEMS
Heng Guo et al.
SIAM JOURNAL ON COMPUTING (2013)
AN EFFECTIVE DICHOTOMY FOR THE COUNTING CONSTRAINT SATISFACTION PROBLEM
Martin Dyer et al.
SIAM JOURNAL ON COMPUTING (2013)
GRAPH HOMOMORPHISMS WITH COMPLEX VALUES: A DICHOTOMY THEOREM
Jin-Yi Cai et al.
SIAM JOURNAL ON COMPUTING (2013)
The complexity of weighted and unweighted #CSP
Andrei Bulatov et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2012)
Holographic algorithms
Leslie G. Valiant
SIAM JOURNAL ON COMPUTING (2008)
The complexity of partition functions
A Bulatov et al.
THEORETICAL COMPUTER SCIENCE (2005)
Quantum circuits that can be simulated classically in polynomial time
LG Valiant
SIAM JOURNAL ON COMPUTING (2002)
Exact and asymptotic measures of multipartite pure-state entanglement
CH Bennett et al.
PHYSICAL REVIEW A (2001)
Three qubits can be entangled in two inequivalent ways -: art. no. 062314
W Dür et al.
PHYSICAL REVIEW A (2000)
分享论文
