Complex zeros and algorithms in hard problems of combinatorial counting

Series: 
Graph Theory Seminar
Thursday, March 1, 2018 - 13:30
1.5 hours (actually 80 minutes)
Location: 
Skiles 005
,  
University of Michigan
,  
Organizer: 
 This is Lecture 2 of a series of 3 lectures by the speaker. See the abstract on Tuesday's ACO colloquium of this week. (Please note that this lecture will be 80 minutes' long.)