A mildly exponential approximation algorithm for the permanent
From MaRDI portal
Recommendations
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
- Approximating permanents of complex matrices
- scientific article; zbMATH DE number 4131659
Cites work
- A Monte-Carlo Algorithm for Estimating the Permanent
- An analysis of Monte Carlo algorithm for estimating the permanent
- Approximating the Permanent
- scientific article; zbMATH DE number 420886 (Why is no real title available?)
- scientific article; zbMATH DE number 1263268 (Why is no real title available?)
- Monte-Carlo algorithms for the planar multiterminal network reliability problem
- Random generation of combinatorial structures from a uniform distribution
- The complexity of computing the permanent
Cited in
(11)- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
- A permanent formula with many zero-valued terms
- Approximating permanents of complex matrices
- An exponential time 2-approximation algorithm for bandwidth
- Approximating the permanent: A simple approach
- Extending the minc-brègman upper bound for the permanent
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
- Clifford algebras and approximating the permanent
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
- A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices
- Calculation of the permanent of a sparse positive matrix
This page was built for publication: A mildly exponential approximation algorithm for the permanent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923855)
