Lower Bounds for Matching Vector Codes

Computer Science/Discrete Mathematics Seminar II
Topic:Lower Bounds for Matching Vector Codes
Speaker:Abhishek Bhowmick
Affiliation:University of Texas at Austin
Date:Tuesday, May 1
Time/Room:10:30am - 12:30pm/S-101

<a href="http://math.ias.edu/files/seminars/Bhowmick.pdf">http://math.ias.edu/files/seminars/Bhowmick.pdf</a>