Fetching the paper…
Reading the bibliography…
The problem of computing the permanent of a matrix has attracted interest since the work of Ryser(1963) and Valiant(1979).
Koetter, R. and Vardy, A. (2003). The structure of tail-biting trellises: Minimality and basic principles. IEEE Trans. Inf. Theory
1901
Earlier work this paper cites.
1904
Earlier work this paper cites.
Sayir, J. and Sarwar, J. (2015) An investigation of SUDOKU-inspired non-linear codes with local constraints. In Proceedings 2015 IEEE International Symposium on Information Theory
1925
Earlier work this paper cites.
Bellman, R. (1957) Dynamic Programming
1957
Earlier work this paper cites.
Held, M., and Karp, R. M. (1962). A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics
1962
Earlier work this paper cites.
Ryser, H. J. (1963). Combinatorial Mathematics
1963
Earlier work this paper cites.
Erdös, P. and Rényi, A. (1964). On Random Matrices. Publ. Math. Inst. Hungar. Acad. Sci. 8, pp. 455–461
1964
Earlier work this paper cites.
Forney, G. D. Jr. (1967). Final report on a coding system design for advanced solar missions. Contract NAS2-3637, NASA Ames Research Center, CA, December
1967
Earlier work this paper cites.
Viterbi, A. J. (1967) Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions Information Theory
1967
Earlier work this paper cites.
Vaughan, R. J., Venables, W. N. (1972). Permanent expressions for order statistic densities. J. Roy. Statist. Soc. Ser. B
1972
Earlier work this paper cites.
Nijenhuis, A. and Wilf, H. S. (1978). Combinatorial algorithms: for computers and calculators
1978
Cited alongside, same era.
Valiant, L. G. (1979). The Complexity of Computing the Permanent. Theoretical Computer Science
1979
Cited alongside, same era.
Bapat, R., and Beg, M. (1989). Order statistics for nonidentically distributed variables and permanents. Sankhyā Ser. A
1989
Cited alongside, same era.
Vardy, A. (1998) Trellis structure of codes, Ch. 24, pp. 1989–2118, in the Handbook of Coding Theory
1989
Cited alongside, same era.
Balasubramanian, K., Beg, M., and Bapat, R. (1991). On families of distributions closed under extrema. Sankhyā Ser. A
1991
Cited alongside, same era.
R. E. Bryant (1992). Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Computing Surveys
Vardy, A. and Kschischang, F. R. (1996). Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis. IEEE Transactions Information Theory
1996
Later among the works it cites.
Clifford, P. and Clifford, R. (2020). Faster classical Boson Sampling. arXiv:2005.04214v2
2005
Later among the works it cites.
Servedio, R. A. and Wan, A. (2005). Computing sparse permanents faster. Inf. Proc. Lett
2005
Later among the works it cites.
Glueck, D. H., Karimpour-Fard, A., Mandel, J., Hunter, L., and Muller, K. E. (2008). Fast computation by block permanents of cumulative distribution functions of order statistics from several populations. Communications in Statistics–Theory and Methods
2008
Later among the works it cites.
Glynn, D. G. (2010). The permanent of a square matrix. European Journal of Combinatorics
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1992
Cited alongside, same era.
R. E. Bryant (1995). Binary decision diagrams and beyond: Enabling technologies for formal verification, in Proc. International Conf. Computer-Aided Design
1995
Cited alongside, same era.
Balasubramanian, K., Beg, M., and Bapat, R. (1996). An identity for the joint distribution of order statistics and its applications. J. Statist. Plann. Infer
1996
Cited alongside, same era.
Kschischang, F. R. (1996). The trellis structure of maximal fixed cost codes. IEEE Transactions Information Theory
1996
Cited alongside, same era.
McEliece, R. J. (1996). On the BCJR trellis for linear block codes. IEEE Transactions Information Theory
1996
Cited alongside, same era.
2010
Later among the works it cites.
S. Aaronson and A. Arkhipov, A. (2011). The computational complexity of linear optics. In Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing
2011
Later among the works it cites.
Stanley, R. P. (2011). Enumerative Combinatorics
2011
Later among the works it cites.
Björklund, A., Husfeldt, T. , Kaski, P. , Koivisto, M. (2012). The travelling salesman problem in bounded degree graphs. ACM Transactions on Algorithms
2012
Later among the works it cites.
Shchesnovich, V. (2013). Asymptotic evaluation of bosonic probability amplitudes in linear unitary networks in the case of large number of bosons. International Journal of Quantum Information
2013
Later among the works it cites.
Clifford, P. and Clifford, R. (2018). The classical complexity of boson sampling. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
2018
Later among the works it cites.