Bounds on the permanent and some applications

Leonid Gurvits; Alex Samorodnitsky

doi:10.1109/FOCS.2014.18

Bounds on the permanent and some applications

Leonid Gurvits, Alex Samorodnitsky

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

27 Scopus citations

Abstract

We give new lower and upper bounds on the permanent of a doubly stochastic matrix. Combined with previous work, this improves on the deterministic approximation factor. We also give a combinatorial application of the lower bound, proving S. Friedland's 'Asymptotic Lower Matching Conjecture'for the monomer-dimer problem.

Original language	English
Title of host publication	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Publisher	IEEE Computer Society
Pages	90-99
Number of pages	10
ISBN (Electronic)	9781479965175
DOIs	https://doi.org/10.1109/FOCS.2014.18
State	Published - 7 Dec 2014
Event	55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014 - Philadelphia, United States Duration: 18 Oct 2014 → 21 Oct 2014

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)	0272-5428

Conference

Conference	55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014
Country/Territory	United States
City	Philadelphia
Period	18/10/14 → 21/10/14

Bibliographical note

Publisher Copyright:
© 2014 IEEE.

Keywords

approximation of the permanent
bounds on the permanent

Access to Document

10.1109/FOCS.2014.18

Cite this

@inproceedings{81ed8e083d494fe39d9bc63f6ab4d0c6,

title = "Bounds on the permanent and some applications",

abstract = "We give new lower and upper bounds on the permanent of a doubly stochastic matrix. Combined with previous work, this improves on the deterministic approximation factor. We also give a combinatorial application of the lower bound, proving S. Friedland's 'Asymptotic Lower Matching Conjecture'for the monomer-dimer problem.",

keywords = "approximation of the permanent, bounds on the permanent",

author = "Leonid Gurvits and Alex Samorodnitsky",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014 ; Conference date: 18-10-2014 Through 21-10-2014",

year = "2014",

month = dec,

day = "7",

doi = "10.1109/FOCS.2014.18",

language = "אנגלית",

series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

publisher = "IEEE Computer Society",

pages = "90--99",

booktitle = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

address = "ארצות הברית",

}

Gurvits, L & Samorodnitsky, A 2014, Bounds on the permanent and some applications. in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS., 6978993, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, IEEE Computer Society, pp. 90-99, 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, United States, 18/10/14. https://doi.org/10.1109/FOCS.2014.18

Bounds on the permanent and some applications. / Gurvits, Leonid; Samorodnitsky, Alex.
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society, 2014. p. 90-99 6978993 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Bounds on the permanent and some applications

AU - Gurvits, Leonid

AU - Samorodnitsky, Alex

PY - 2014/12/7

Y1 - 2014/12/7

N2 - We give new lower and upper bounds on the permanent of a doubly stochastic matrix. Combined with previous work, this improves on the deterministic approximation factor. We also give a combinatorial application of the lower bound, proving S. Friedland's 'Asymptotic Lower Matching Conjecture'for the monomer-dimer problem.

AB - We give new lower and upper bounds on the permanent of a doubly stochastic matrix. Combined with previous work, this improves on the deterministic approximation factor. We also give a combinatorial application of the lower bound, proving S. Friedland's 'Asymptotic Lower Matching Conjecture'for the monomer-dimer problem.

KW - approximation of the permanent

KW - bounds on the permanent

UR - http://www.scopus.com/inward/record.url?scp=84920025973&partnerID=8YFLogxK

U2 - 10.1109/FOCS.2014.18

DO - 10.1109/FOCS.2014.18

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84920025973

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 90

EP - 99

BT - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

PB - IEEE Computer Society

T2 - 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014

Y2 - 18 October 2014 through 21 October 2014

ER -

Bounds on the permanent and some applications

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this