Probabilistic and deterministic approximations of the permanent

Avi Wigderson*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The exact computation of the permanent of a matrix is #P- complete. Many efforts have been made to efficiently approximate the permanent. In this talk we will survey some of these methods, both probabilistic and deterministic. The papers below and the references within them serve as a good source of information on this topic.

Original languageEnglish
Title of host publicationRandomization, Approximation, and Combinatorial Optimization
Subtitle of host publicationAlgorithms and Techniques - 3rd International Workshop on Randomization and Approximation Techniques in Computer Science and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX 1999, Proceedings
EditorsJose D. P. Rolim, Alistair Sinclair, Dorit Hochbaum, Klaus Jansen
PublisherSpringer Verlag
ISBN (Print)3540663290, 9783540663294
DOIs
StatePublished - 1999
Event3rd International Workshop on Randomization and Approximation Techniques in Computer Science and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX 1999 - Berkeley, United States
Duration: 8 Aug 199911 Aug 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1671
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Workshop on Randomization and Approximation Techniques in Computer Science and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX 1999
Country/TerritoryUnited States
CityBerkeley
Period8/08/9911/08/99

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.

Fingerprint

Dive into the research topics of 'Probabilistic and deterministic approximations of the permanent'. Together they form a unique fingerprint.

Cite this