Random path method with pivoting for computing permanents of matrices

DOI10.1016/j.amc.2006.07.070zbMath1135.65023OpenAlexW2123908066MaRDI QIDQ870138

Heng Liang, Feng-Shan Bai, Xiao Yan Liu, Lin-Song Shi

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

zbMATH Keywords

numerical examplesMonte Carlo methodpermanentunbiased estimatorrandom path methodRasmussen method

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical computation of determinants (65F40)

Related Items (2)

A hybrid algorithm for multi-homogeneous Bézout number ⋮ Flexible manufacturing system selection using a combinatorial mathematics-based decision-making method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Random generation of combinatorial structures from a uniform distribution
• Matching theory
• An upper bound for the permanent of \((0,1)\)-matrices.
• Approximating the number of monomer-dimer coverings of a lattice.
• An analysis of Monte Carlo algorithm for estimating the permanent
• Systems of distinct representatives. II
• 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
• Permanents
• Clifford algebras and approximating the permanent

This page was built for publication: Random path method with pivoting for computing permanents of matrices