Approximating permanents of complex matrices
From MaRDI portal
Recommendations
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- Computing the permanent of (some) complex matrices
- A mildly exponential approximation algorithm for the permanent
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
- scientific article; zbMATH DE number 4131659
Cited in
(14)- A remark on approximating permanents of positive definite matrices
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- Computing the permanent of (some) complex matrices
- Approximating the -permanent
- On the hardness of approximating the permanent of structured matrices
- Clifford algebras and approximating the permanent
- scientific article; zbMATH DE number 599405 (Why is no real title available?)
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
- scientific article; zbMATH DE number 4131659 (Why is no real title available?)
- Approximating the permanent with fractional belief propagation
- Computing permanents of complex diagonally dominant matrices and tensors
- Approximating permanents and hafnians
- Approximating the permanent via nonabelian determinants
- New inequalities for permanents and hafnians and some generalizations
This page was built for publication: Approximating permanents of complex matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192039)