1. R. Bubley, M. Dyer, Graph orientations with no sink and an approximation for a hard case of #SAT, in: Proceedings of the Eighth Annual ACM–SIAM Symposium on Discrete Algorithms, 1997, pp. 248–257
2. Some results on matchgates and holographic algorithms;Cai,2006
3. J.-Y. Cai, V. Choudhary, Valiant’s Holant theorem and matchgate tensors, in: Theory and Applications of Models of Computation: Third International Conference, TAMC 2006 in: LNCS, vol. 3959, Springer-Verlag, pp. 248–261
4. M. Cook, Networks of relations, Ph.D. Thesis, 2005
5. Complexity of generalized satisfiability counting problems;Creignou;Information and Computation,1996