An upper bound for permanents of nonnegative matrices (Q2474496)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound for permanents of nonnegative matrices |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for permanents of nonnegative matrices |
scientific article |
Statements
An upper bound for permanents of nonnegative matrices (English)
0 references
6 March 2008
0 references
The author investigates upper bounds on the permanent of matrices with nonnegative entries. He is interested in upper bounds for matrices with general nonnegative entries. The original motivation for this study was computational. The goal is to conduct an efficient deterministic algorithm that approximates the permanent within a reasonable multiplicative factor. The proof of Theorem 1.3 proceeds along the lines of \textit{L. M. Brégman}'s proof [Sov. Math., Dokl. 14, 945--949 (1973; Zbl 0293.15010)] of the Minc's conjecture.
0 references
bounds and approximation
0 references
algorithms for the permanent
0 references
0 references
0 references
0 references
0 references
0.8714775443077087
0 references
0.8687853217124939
0 references
0.8679853677749634
0 references
0.855747401714325
0 references
0.8433436751365662
0 references
