TY - GEN
T1 - Bounds on the permanent and some applications
AU - Gurvits, Leonid
AU - Samorodnitsky, Alex
N1 - Publisher Copyright:
© 2014 IEEE.
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 - https://www.scopus.com/pages/publications/84920025973
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 -