Bounds on the permanent and some applications

Leonid Gurvits, Alex Samorodnitsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageAmerican English
Title of host publicationProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
PublisherIEEE Computer Society
Pages90-99
Number of pages10
ISBN (Electronic)9781479965175
DOIs
StatePublished - 7 Dec 2014
Event55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014 - Philadelphia, United States
Duration: 18 Oct 201421 Oct 2014

Publication series

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

Conference

Conference55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014
Country/TerritoryUnited States
CityPhiladelphia
Period18/10/1421/10/14

Bibliographical note

Publisher Copyright:
© 2014 IEEE.

Keywords

  • approximation of the permanent
  • bounds on the permanent

Fingerprint

Dive into the research topics of 'Bounds on the permanent and some applications'. Together they form a unique fingerprint.

Cite this