Holographic reduction for some counting problems

Authors:
Chen Yuan;Haibin Kan
Affiliations:
School of Computer Science, Fudan University, China;School of Computer Science, Fudan University, China
Venue:
Information Processing Letters
Year:
2011

Citing 6
Cited 0

The Complexity of Counting in Sparse, Regular, and Planar Graphs

SIAM Journal on Computing
Holographic Algorithms (Extended Abstract)

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Holographic algorithms: from art to science

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Some results on matchgates and holographic algorithms

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Quantified Score

Hi-index	0.89

Visualization

Abstract

Holographic reduction is a powerful tool to divide a line between tractable cases and #P-hardness. Based on dichotomies of #CSP, Holant^@? and Holant^c problem, we succeed to give a dichotomy for some particular problems in Cai et al. (2008) [5] and Valiant (2004) [8].