On Symmetric Signatures in Holographic Algorithms-Reference-Cited by-同舟云学术

On Symmetric Signatures in Holographic Algorithms

Published:2009-07-21 Issue:3 Volume:46 Page:398-415
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Cai Jin-Yi,Lu Pinyan

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-009-9229-z.pdf

Reference22 articles.

1. Bubley, R., Dyer, M.: Graph orientations with no sink and an approximation for a hard case of #SAT. In: ACM SODA, pp. 248–257 (1997)

2. Cai, J.-Y., Choudhary, V.: Valiant’s Holant theorem and matchgate tensors. In: Proceedings of TAMC 2006. Lecture Notes in Computer Science, vol. 3959, pp. 248–261. Theor. Comput. Sci. 384(1), 22–32 (2007). Also available as ECCC TR05-118

3. Lecture Notes in Computer Science;J.-Y. Cai,2007

4. Cai, J.-Y., Choudhary, V., Lu, P.: On the theory of matchgate computations. In: Proceedings of CCC’07: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity, pp. 305–318. IEEE Computer Society, Washington (2007)

5. Lecture Notes in Computer Science;J.-Y. Cai,2007

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Holographic Algorithms on Domains of General Size;Theory of Computing Systems;2022-07-01

2. FKT is Not Universal — A Planar Holant Dichotomy for Symmetric Constraints;Theory of Computing Systems;2021-08-09

3. The complexity of planar Boolean #CSP with complex weights;Journal of Computer and System Sciences;2020-02

4. Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP;SIAM Journal on Computing;2017-01

5. Base collapse of holographic algorithms;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19