Fetching the paper…
Reading the bibliography…
The permanent is a function, defined for a square matrix, with applications in various domains including quantum computing, statistical physics, complexity theory, combinatorics, and graph theory.
doi:10.4153/CJM-1958-052-0
A. L. Dulmage, N. S. Mendelsohn, Coverings of bipartite graphs, Canadian Journal of Math. 10 (1958) 517–534 · 1958
Earlier work this paper cites.
H. Ryser, Combinatorial Mathematics, Mathematical Association of America, 1963
1963
Earlier work this paper cites.
W. Kahan, Pracniques: Further remarks on reducing truncation errors, Communications of the ACM 8 (1) (1965) 40
1965
Earlier work this paper cites.
T. J. Dekker, A floating-point technique for extending the available precision, Numerische Mathematik 18 (1971) 224–242
1971
Earlier work this paper cites.
doi:10.1137/0201010
R. Tarjan, Depth-first search and linear graph algorithms, SIAM Journal on Computing 1 (2) (1972) 146–160 · 1972
Earlier work this paper cites.
doi:10.1137/0202019
J. E. Hopcroft, R. M. Karp, An n 5 / 2 n^{5/2} algorithm for maximum matchings in bipartite graphs, SIAM Journal on Computing 2 (4) (1973) 225–231 · 1973
Earlier work this paper cites.
A. Nijenhuis, H. S. Wilf, Combinatorial Algorithms, Academic Press, 1978
1978
Earlier work this paper cites.
https://doi.org/10.1016/0304-3975(79)90044-6
L. Valiant, The complexity of computing the permanent, Theoretical Comp. Sci. 8 (2) (1979) 189–201 · 1979
Earlier work this paper cites.
doi:https://doi.org/10.1016/0304-3975(79)90044-6
L. Valiant, The complexity of computing the permanent, Theoretical Computer Science 8 (2) (1979) 189–201 · 1979
Earlier work this paper cites.
doi:10.1145/98267.98287
A. Pothen, C.-J. Fan, Computing the block triangular form of a sparse matrix, ACM Transactions on Mathematical Software 16 (4) (1990) 303–324 · 1990
Earlier work this paper cites.
D. Goldberg, What every computer scientist should know about floating-point arithmetic, ACM Computing Surveys (CSUR) 23 (1) (1991) 5–48
1991
Earlier work this paper cites.
doi:10.1109/ISTCS.1993.253457
A. Ben-Dor, 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.
doi:https://doi.org/10.1006/jcph.1998.6149
I. Beichl, F. Sullivan, Approximating the permanent via importance sampling with application to the dimer covering problem, Journal of Computational Physics 149 (1) (1999) 128–147 · 1998
Cited alongside, same era.
doi:10.1080/00207160108805061
R. Mittal, A. Al-Kurdi, Efficient computation of the permanent of a sparse matrix, International Journal of Computer Mathematics 77 (2) (2001) 189–199 · 2001
Cited alongside, same era.
doi:https://doi.org/10.1016/S0010-4655(02)00683-5
H. Forbert, D. Marx, Calculation of the permanent of a sparse positive matrix, Computer Physics Communications 150 (3) (2003) 267–273 · 2003
Cited alongside, same era.
doi:10.1016/j.amc.2004.11.020
H. Liang, S. Huang, F. Bai, A hybrid algorithm for computing permanents of sparse matrices, Appl. Math. Comput. 172 (2) (2006) 708–716 · 2004
Cited alongside, same era.
D. Knuth, The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming), Addison-Wesley Professional, 2005
2005
Cited alongside, same era.
M. Narahara, K. Tamaki, R. Yamada, Application of permanents of square matrices for DNA identification in multiple-fatality cases, BMC Genetics 14 (72) (2013)
2013
Later among the works it cites.
doi:10.1103/PhysRevA.91.042316
D. J. Brod, Complexity of simulating constant-depth Boson Sampling, Phys. Rev. A 91 (2015) 042316 · 2015
Later among the works it cites.
doi:10.1093/nsr/nwy079
J. Wu, Y. Liu, B. Zhang, X. Jin, Y. Wang, H. Wang, X. Yang, · 2018
Later among the works it cites.
doi:10.1093/nsr/nwy079
J. Wu, Y. Liu, B. Zhang, X. Jin, Y. Wang, H. Wang, X. Yang, A benchmark test of boson sampling on Tianhe-2 supercomputer, National Science Review 5 (5) (2018) 715–720 · 2018
Later among the works it cites.
K. Kaya, Parallel algorithms for computing sparse matrix permanents, Turkish Journal of Electrical Engineering and Computer Science 27 (2019) 4284 – 4297
2019
Later among the works it cites.
https://doi.org/10.1016/j.jcp.2022.110990
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
doi:10.1216/rmjm/1199649832
E. Kılıç, 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 37 (12 2007) · 2007
Cited alongside, same era.
doi:{10.5209/rev\_REMA.2007.v20.n1.16528}
N. Balakrishnan, Permanents, order statistics, outliers, and robustness, Revista Matematica Complutense, 2007 20 (03 2007) · 2007
Cited alongside, same era.
doi:10.1103/PhysRevE.77.016706
Y. Huo, H. Liang, S.-Q. Liu, F. Bai, Computing monomer-dimer systems through matrix permanent, Phys. Rev. E 77 (2008) 016706 · 2008
Cited alongside, same era.
L. Lovász, M. Plummer, Matching Theory, AMS Chelsea Publishing Series, AMS Chelsea Publishing Series, 2009
2009
Cited alongside, same era.
doi:10.1145/1993636.1993682
S. Aaronson, A. Arkhipov, The computational complexity of linear optics , in: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC ’11, ACM, New York, NY, USA, 2011, pp. 333–342 · 2011
Cited alongside, same era.
J. Merschen, Nash equilibria, Gale strings, and perfect matchings, Ph.D. thesis, The London School of Econ. and Political Science (LSE) (1 2011)
2011
Cited alongside, same era.
P. Lundow, K. Markström, Efficient computation of permanents, with applications to boson sampling and random matrices, Journal of Computational Physics 455 (2022) 110990 · 2022
Later among the works it cites.
doi:https://doi.org/10.1016/j.jcp.2022.110990
P. Lundow, K. Markström, Efficient computation of permanents, with applications to boson sampling and random matrices, Journal of Computational Physics 455 (2022) 110990 · 2022
Later among the works it cites.
F. Dufossé, K. Kaya, I. Panagiotas, B. Uçar, Scaling matrices and counting the perfect matchings in graphs, Discrete Applied Mathematics 308 (2022) 130–146
2022
Later among the works it cites.
NVIDIA, CUDA C++ Prog. Guide , accessed: 2024-09-13 (2024). URL https://docs.nvidia.com/cuda/cuda-c-programming-guide/index.html
2024
Later among the works it cites.
D. Elbek, K. Kaya, Fully-automated code generation for efficient computation of sparse matrix permanents on gpus (2025) · 2025
Closest in time.
N. D. Forums, Quads in CUDA , accessed: 2025-02-08 (Accessed 2025). URL https://forums.developer.nvidia.com/t/quads-in-cuda/23556/5
2025
Closest in time.