scientific article; zbMATH DE number 1263268

zbMath0925.68209MaRDI QIDQ4234141

Mark R. Jerrum

Publication date: 3 November 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityrandom matrices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Monte Carlo methods (65C05)

Related Items (3)

A mildly exponential approximation algorithm for the permanent ⋮ Computing the permanent by importance sampling method. ⋮ Approximating the number of monomer-dimer coverings of a lattice.

This page was built for publication: