Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference31 articles.
1. Algorithmic Number Theory, vol. 1: Efficient Algorithms;Bach,1996
2. S. Cook, The complexity of theorem proving procedures, in: Proceedings of the Third Annual ACM Symposium on Theory of Computing, 1971, pp. 151–158.
3. Some results on matchgates and holographic algorithms;Cai,2006
4. Valiant's Holant Theorem and matchgate tensors;Cai,2006
5. J.-Y. Cai, Vinay Choudhary, Pinyan Lu, On the theory of matchgate computations, in: IEEE Conference on Computational Complexity, 2007, pp. 305–318.
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献