Some Observations on Holographic Algorithms-Reference-Cited by-同舟云学术

Some Observations on Holographic Algorithms

Published:2010 Issue: Volume: Page:577-590
ISSN:0302-9743
Container-title:LATIN 2010: Theoretical Informatics
language:
Short-container-title:

Author:

Valiant Leslie G.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12200-2_50.pdf

Reference31 articles.

1. Barbanchon, R.: Reductions fines entre problèmes NP-complets, PhD Thesis, Université de Caen Basse-Normandie (2003)

2. Barbanchon, R.: On unique graph 3-colorability and parsimonious reductions in the plane. Theoretical Computer Science 319(1-3), 455–482 (2004)

3. Bubley, R., Dyer, M., Greenhill, C., Jerrum, M.: On approximately counting colourings of small degree graphs. SIAM J. Comput. 29, 387–400 (1999)

4. Cai, J.-Y., Choudhary, V.: Some Results on Matchgates and Holographic Algorithms. International Journal of Software and Informatics 1(1), 3–36 (2007)

5. Cai, J.-Y., Choudhary, V., Lu, P.: On the Theory of Matchgate Computations. Theory of Computing Systems 45(1), 108–132 (2009)

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

1. On blockwise symmetric matchgate signatures and higher domain #CSP;Information and Computation;2019-02

2. Basis collapse for holographic algorithms over all domain sizes;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19

3. A Dichotomy for Real Weighted Holant Problems;computational complexity;2015-11-17

4. A Holant Dichotomy: Is the FKT Algorithm Universal?;2015 IEEE 56th Annual Symposium on Foundations of Computer Science;2015-10

5. A collapse theorem for holographic algorithms with matchgates on domain size at most 4;Information and Computation;2014-12