相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。NONNEGATIVE WEIGHTED #CSP: AN EFFECTIVE COMPLEXITY DICHOTOMY
Jin-Yi Cai et al.
SIAM JOURNAL ON COMPUTING (2016)
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)
A COMPLEXITY DICHOTOMY FOR PARTITION FUNCTIONS WITH MIXED SIGNS
Leslie Ann Goldberg et al.
SIAM JOURNAL ON COMPUTING (2010)
THE CSP DICHOTOMY HOLDS FOR DIGRAPHS WITH NO SOURCES AND NO SINKS (A POSITIVE ANSWER TO A CONJECTURE OF BANG-JENSEN AND HELL)
Libor Barto et al.
SIAM JOURNAL ON COMPUTING (2009)
Colouring, constraint satisfaction, and complexity
Pavol Hell et al.
COMPUTER SCIENCE REVIEW (2008)
On counting homomorphisms to directed acyclic graphs
Martin Dyer et al.
JOURNAL OF THE ACM (2007)
Towards a dichotomy theorem for the counting constraint satisfaction problem
Andrei A. Bulatov et al.
INFORMATION AND COMPUTATION (2007)
A simple algorithm for Mal'tsev constraints
Andrei Bulatov et al.
SIAM JOURNAL ON COMPUTING (2006)
The complexity of partition functions
A Bulatov et al.
THEORETICAL COMPUTER SCIENCE (2005)
分享论文
