Complexity of counting integer points
Geometric and topological combinatorics: Modern techniques and methods October 09, 2017 - October 13, 2017
Location: SLMath: Eisenbud Auditorium
Tags/Keywords
Integer points
convex polytopes
15-Pak
I will survey some recent progress on complexity of counting integer points in convex polytopes of fixed dimension. A few our results will have a seductively easy yet counterintuitive statements. The talk will assume no background and will be very accessible. Joint work with Danny Nguyen.
Pak Notes
|
Download |
15-Pak
H.264 Video |
15-Pak.mp4
|
Download |
Please report video problems to itsupport@slmath.org.
See more of our Streaming videos on our main VMath Videos page.