Lee-Yang theorems and the complexity of computing averages - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Alistair Sinclair' in GoogleThis author has not been identified. Look up 'Piyush Srivastava' in Google

runs on WebDSL