scientific article; zbMATH DE number 4131659

zbMATH Open0691.68044MaRDI QIDQ3033320FDOQ3033320

Authors: Michael Luby 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• Approximating the Permanent
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• Approximating permanents of complex matrices
• Approximating the permanent via nonabelian determinants
• On coupling and the approximation of the permanent

zbMATH Keywords

complexitydeterminantpermanentcomputational

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Determinants, permanents, traces, other special matrix functions (15A15)

Cited In (10)

• On coupling and the approximation of the permanent
• Approximating the permanent of graphs with large factors
• Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
• Matching theory -- a sampler: From Dénes König to the present
• Approximating the permanent with fractional belief propagation
• Approximating permanents and hafnians
• Approximating the permanent via nonabelian determinants
• Monte Carlo algorithms for computing \(\alpha \)-permanents
• Approximating permanents of complex matrices
• Approximating the Permanent

This page was built for publication:

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