Efficient computation of permanents, with applications to Boson sampling and random matrices

This publication has 17 references indexed in Scilit:

• General Rules for Bosonic Bunching in Multimode Interferometers
  Physical Review Letters, 2013
• The $1$-Vertex Transfer Matrix and Accurate Estimation of Channel Capacity
  IEEE Transactions on Information Theory, 2010
• On the permanent of random Bernoulli matrices
  Advances in Mathematics, 2009
• Combinatorial bounds via measure and conquer
  ACM Transactions on Algorithms, 2008
• Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms
  LMS Journal of Computation and Mathematics, 2008
• Compression of transfer matrices
  Discrete Mathematics, 2001
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
  Discrete Applied Mathematics, 2001
• The complexity of computing the permanent
  Theoretical Computer Science, 1979
• Pracniques: further remarks on reducing truncation errors
  Communications of the ACM, 1965
• A Note on the Generation of Random Normal Deviates
  The Annals of Mathematical Statistics, 1958