Author:
Cai Jin-Yi,Galanis Andreas,Goldberg Leslie Ann,Guo Heng,Jerrum Mark,Štefankovič Daniel,Vigoda Eric
Funder
NSF
2013 Simons Award for Graduate Students in Theoretical Computer Science
European Research Council
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference31 articles.
1. The complexity of the counting constraint satisfaction problem;Bulatov,2008
2. The expressibility of functions on the Boolean domain, with applications to counting CSPs;Bulatov;J. ACM,2013
3. Complexity of counting CSP with complex weights;Cai,2012
4. Inapproximability after uniqueness phase transition in two-spin systems;Cai,2012
5. Holant problems and counting CSP;Cai,2009
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献