A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
We consider the problem of computing the permanent of a n by n matrix. For a class of matrices corresponding to constant degree expanders we construct a deterministic polynomial time approximation algorithm to within a multiplicative factor ( 1 + ∈)[superscript η] for arbitrary∈ > 0. This is an i...
| Hlavní autoři: | , |
|---|---|
| Další autoři: | |
| Médium: | Článek |
| Jazyk: | en_US |
| Vydáno: |
Elsevier
2017
|
| On-line přístup: | http://hdl.handle.net/1721.1/108274 https://orcid.org/0000-0001-8898-8778 |