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 language | English |
---|---|
Title of host publication | Randomization, Approximation, and Combinatorial Optimization |
Subtitle of host publication | Algorithms 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 |
Editors | Jose D. P. Rolim, Alistair Sinclair, Dorit Hochbaum, Klaus Jansen |
Publisher | Springer Verlag |
ISBN (Print) | 3540663290, 9783540663294 |
DOIs | |
State | Published - 1999 |
Event | 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 - Berkeley, United States Duration: 8 Aug 1999 → 11 Aug 1999 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 1671 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 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 |
---|---|
Country/Territory | United States |
City | Berkeley |
Period | 8/08/99 → 11/08/99 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1999.