Computing the permanent by importance sampling method.

DOI10.1007/BF02366856MaRDI QIDQ1385764zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3817702 (Why is no real title available?)
• scientific article; zbMATH DE number 3817895 (Why is no real title available?)
• scientific article; zbMATH DE number 4023282 (Why is no real title available?)
• scientific article; zbMATH DE number 1256668 (Why is no real title available?)
• scientific article; zbMATH DE number 1263268 (Why is no real title available?)
• scientific article; zbMATH DE number 822898 (Why is no real title available?)
• A Monte-Carlo Algorithm for Estimating the Permanent
• Approximating the Permanent
• On coupling and the approximation of the permanent
• The complexity of computing the permanent

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385764)