###### Inspiring lectures

## Computational complexity and complex geometry

Alexander Barvinok Friday, May 18 at 9:00 AM Abstract I will discuss a general principle: if a combinatorially defined polynomial (such as the permanent of a matrix or the independence polynomial of a graph) has no zeros in a certain complex domain, then it can be efficiently computed (approximated) in Read more…