Alistair Sinclair, Piyush Srivastava. Lee-Yang theorems and the complexity of computing averages. In Dan Boneh, Tim Roughgarden, Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. pages 625-634, ACM, 2013. [doi]
@inproceedings{SinclairS13,
title = {Lee-Yang theorems and the complexity of computing averages},
author = {Alistair Sinclair and Piyush Srivastava},
year = {2013},
doi = {10.1145/2488608.2488686},
url = {http://doi.acm.org/10.1145/2488608.2488686},
researchr = {https://researchr.org/publication/SinclairS13},
cites = {0},
citedby = {0},
pages = {625-634},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013},
editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum},
publisher = {ACM},
isbn = {978-1-4503-2029-0},
}