Computing the permanent by importance sampling method.

DOI10.1007/BF02366856zbMath1034.68523OpenAlexW2025601012MaRDI QIDQ1385764

N. Yu. Kuznetsov

Publication date: 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02366856

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Efficient generation of random derangements with the expected distribution of cycle lengths ⋮ Applying fast simulation to find the number of good permutations

Cites Work

• The complexity of computing the permanent
• On coupling and the approximation of the permanent
• Approximating the Permanent
• A Monte-Carlo Algorithm for Estimating the Permanent
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the permanent by importance sampling method.