Random path method with pivoting for computing permanents of matrices
DOI10.1016/J.AMC.2006.07.070zbMATH Open1135.65023OpenAlexW2123908066MaRDI QIDQ870138FDOQ870138
Fengshan Bai, Xiaoyan Liu, Lin-Song Shi, Heng Liang
Publication date: 12 March 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.07.070
Monte Carlo methods (65C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matching theory
- Approximating the number of monomer-dimer coverings of a lattice.
- Combinatorial matrix theory
- The complexity of computing the permanent
- Random generation of combinatorial structures from a uniform distribution
- Permanents
- Approximating the Permanent
- A Monte-Carlo Algorithm for Estimating the Permanent
- Approximating the permanent: A simple approach
- A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
- An upper bound for the permanent of \((0,1)\)-matrices.
- An analysis of Monte Carlo algorithm for estimating the permanent
- Systems of distinct representatives. II
- Clifford algebras and approximating the permanent
Cited In (3)
This page was built for publication: Random path method with pivoting for computing permanents of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870138)
