Deterministic Algorithms for counting common bases of Matroids

Series
Lorentzian Polynomials Seminar
Time
Tuesday, November 12, 2019 - 2:50pm for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Mohit Singh – Georgia Tech
Organizer
Trevor Gunn

I will continue to describe deterministic algorithms for approximately counting common bases of matroids within an exponential factor. This is based on AOVI and previous works of AO.