scientific article; zbMATH DE number 4131659

MaRDI QIDQ3033320zbMATH OpenFDO

Authors Michael Luby

Publication date 1990

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)

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

Cited in

(10)

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

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)