Subject
Computer Networks and Communications,Computer Science Applications,Information Systems
Reference27 articles.
1. Valiant, L.G., The Complexity of Computing the Permanent, Theoret. Comput.Sci., 1979, vol. 8, no. 2, pp. 189–201. https://doi.org/10.1016/0304-3975(79)90044-6
2. Björklund, A., Counting Perfect Matchings as Fast as Ryser, in Proc. 23rd Annu. ACM–SIAM Symp. on Discrete Algorithms (SODA'2012), Kyoto, Japan, Jan. 17–19, 2012, pp. 914–921. https://dl.acm.org/doi/10.5555/2095116.2095189
3. Dell, H., Husfeldt, T., Marx, D., Taslaman, N., and Wahlén, M., Exponential Time Complexity of the Permanent and the Tutte Polynomial, ACM Trans. Algorithms, 2014, vol. 10, no. 4, Art. 21 (32 pp.). https://doi.org/10.1145/2635812
4. Kasteleyn, P., Graph Theory and Crystal Physics, Graph Theory and Theoretical Physics, Harary, F., Ed., London: Academic, 1967, pp. 43–110.
5. Galluccio, A. and Loebl, M., On the Theory of Pfaffian Orientations. I: Perfect Matchings and Permanents, Electron. J. Combin., 1999, vol. 6, Art. R6 (18 pp.). https://doi.org/10.37236/1438