Fully-Automated Code Generation for Efficient Computation of Sparse Matrix Permanents on GPUs

D. E. Littlewood and A. R. Richardson, “Group characters and algebras,” Philosophical Transactions of the Royal Society A , vol. 233, no. 721–730, pp. 99–124, 1934

1934

Earlier work this paper cites.

H. Ryser, Combinatorial Mathematics . Mathematical Association of America, 1963

1963

Earlier work this paper cites.

A. Nijenhuis and H. S. Wilf, Combinatorial Algorithms . Academic Press, 1978

1978

Earlier work this paper cites.

L. Valiant, “The complexity of computing the permanent,” Theoretical Computer Science , vol. 8, no. 2, pp. 189–201, 1979. [Online]. Available: https://www.sciencedirect.com/science/article/pii/0304397579900446

1979

Earlier work this paper cites.

A. Ben-Dor and S. Halevi, “Zero-one permanent is not=p-complete, a simpler proof,” in [1993] The 2nd Israel Symposium on Theory and Computing Systems , 1993, pp. 108–117

1993

Earlier work this paper cites.

R. Mittal and A. Al-Kurdi, “Efficient computation of the permanent of a sparse matrix,” International Journal of Computer Mathematics , vol. 77, no. 2, pp. 189–199, 2001

2001

Earlier work this paper cites.

H. Forbert and D. Marx, “Calculation of the permanent of a sparse positive matrix,” Computer Physics Communications , vol. 150, no. 3, pp. 267–273, 2003

2003

Earlier work this paper cites.

D. E. Littlewood, The Theory of Group Characters and Matrix Representations of Groups , 2nd ed. Oxford University Press, 1950, reprinted by AMS, 2006, p. 81

2006

Earlier work this paper cites.

H. Liang, S. Huang, and F. Bai, “A hybrid algorithm for computing permanents of sparse matrices,” Appl. Math. Comput. , vol. 172, no. 2, p. 708–716, jan 2006

2006

Cited alongside, same era.

E. Kılıç and D. Tasci, “On the permanents of some tridiagonal matrices with applications to the fibonacci and lucas numbers,” Rocky Mountain Journal of Mathematics - ROCKY MT J MATH , vol. 37, 12 2007

2007

Cited alongside, same era.

N. Balakrishnan, “Permanents, order statistics, outliers, and robustness,” Revista Matematica Complutense, 2007 , vol. 20, 03 2007

2007

Cited alongside, same era.

Y. Huo, H. Liang, S.-Q. Liu, and F. Bai, “Computing monomer-dimer systems through matrix permanent,” Phys. Rev. E , vol. 77, p. 016706, Jan 2008. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevE.77.016706

2008

Cited alongside, same era.

M. Narahara, K. Tamaki, and R. Yamada, “Application of permanents of square matrices for dna identification in multiple-fatality cases,” BMC Genetics , vol. 14, pp. 72 – 72, 2013

2013

Later among the works it cites.

D. J. Brod, “Complexity of simulating constant-depth bosonsampling,” Phys. Rev. A , vol. 91, p. 042316, Apr 2015. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.91.042316

2015

Later among the works it cites.

J. Wu, Y. Liu, B. Zhang, X. Jin, Y. Wang, H. Wang, and X. Yang, “A benchmark test of boson sampling on Tianhe-2 supercomputer,” National Science Review , vol. 5, no. 5, pp. 715–720, 07 2018

2018

Later among the works it cites.

F. Dufossé, K. Kaya, I. Panagiotas, and B. Uçar, “Scaling matrices and counting the perfect matchings in graphs,” Discrete Applied Mathematics , vol. 308, pp. 130–146, 2022, Comb. Opt.d ISCO 2018

2018

Later among the works it cites.