Reference12 articles.
1. Valiant, L.G., The complexity of enumeration and reliability problems, SIAM J. Comput., 1979, vol. 8, no. 3, pp. 410–421.
2. Björklund, A., Counting perfect matchings as fast as Ryser, Proc. SODA, 2012, pp. 914–921.
3. Perepechko, S.N., Number of perfect matchings in C
m × C
n graphs, Information Processes, 2016, vol. 16, no. 4, pp. 333–361.
4. Petkovšek, M., Symbolic computation with sequences, Program. Comput. Software, 2006, vol. 32, no. 2, pp. 65–70.
5. Kong, Y., Packing dimers on (2p + 1) × (2q + 1) lattices, Phys. Rev., 2006, vol. 016106.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献