Approximating the -permanent
From MaRDI portal
Publication:3399076
Recommendations
- Monte Carlo algorithms for computing \(\alpha \)-permanents
- Estimating the permanent by importance sampling from a finite population
- Approximating permanents of complex matrices
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- An analysis of Monte Carlo algorithm for estimating the permanent
Cited in
(17)- Without-replacement sampling for particle methods on finite state spaces
- A model for positively correlated count variables
- Estimating the permanent by importance sampling from a finite population
- Permanental partition models and Markovian Gibbs structures
- A note on \(\alpha\)-permanent and loop soup
- Efficient computation of permanents, with applications to boson sampling and random matrices
- Testing Independence Under Biased Sampling
- Matrix permanent inequalities for approximating joint assignment matrices in tracking systems
- Permanents, \(\alpha\)-permanents and Sinkhorn balancing
- scientific article; zbMATH DE number 5839812 (Why is no real title available?)
- Sequential importance sampling for estimating expectations over the space of perfect matchings
- Some algebraic identities for the \({\alpha}\)-permanent
- Remarks on the \(\alpha\)-permanent
- Approximating the permanent with fractional belief propagation
- Approximating permanents and hafnians
- Monte Carlo algorithms for computing \(\alpha \)-permanents
- An asymptotic approximation for the permanent of a doubly stochastic matrix
This page was built for publication: Approximating the -permanent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399076)
