A mildly exponential approximation algorithm for the permanent
type: Item
instance of: scholarly article
title: A mildly exponential approximation algorithm for the permanent
zbMATH Open document ID: 0857.68053
DOI: 10.1007/BF01940871
published in: Algorithmica
publication date: 1997-02-18T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 15A15
Mathematics Subject Classification ID: 15B34
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 934117
zbMATH Keywords: perfect matchings
zbMATH Keywords: approximation algorithm
author: Mark Jerrum
author: Umesh V. Vazirani
MaRDI profile type: Publication
cites work: An analysis of Monte Carlo algorithm for estimating the permanent
cites work: Q4234141
cites work: Approximating the Permanent
cites work: Random generation of combinatorial structures from a uniform distribution
cites work: A Monte-Carlo Algorithm for Estimating the Permanent
cites work: Monte-Carlo algorithms for the planar multiterminal network reliability problem
cites work: Q3135094
cites work: The complexity of computing the permanent
full work available at URL: https://doi.org/10.1007/bf01940871
OpenAlex ID: W2029212237
description: scientific article; zbMATH DE number 934117