scientific article; zbMATH DE number 4131659

MaRDI QIDQ3033320zbMATH OpenFDO

Authors Michael Luby

Publication date 1990

zbMATH Keywords

complexitycomputationaldeterminantpermanent

Mathematics Subject Classification ID

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

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

(13)

• On coupling and the approximation of the permanent
• Matching theory -- a sampler: From Dénes König to the present
• Approximating the permanent of graphs with large factors
• Approximating the permanent via importance sampling with application to the dimer covering problem
• Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents
• A mildly exponential approximation algorithm for the permanent
• Monte Carlo algorithms for computing \(\alpha \)-permanents
• Approximating the permanent via nonabelian determinants
• Approximating the permanent with fractional belief propagation
• Approximating permanents of complex matrices
• Approximating the Permanent
• Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
• Approximating permanents and hafnians

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)