Abstract: In this talk, we will state an prove the Minkowski's convex body theorem and see how it can be applied to prove Dirichlet's theorem on (simultaneous) diophantine approximation and to prove the fact that if p is prime wit

Abstract: In the 1980s, Kaltofen proved one of the most remarkable results in algebraic complexity theory.

Abstract: k-means is a popular clustering objective that is NP-hard in theory but often optimized efficiently in practice.

Abstract: Deep Learning has witnessed a 300,000X growth in compute demand in the last 6 years, matched equally by a growth in hardware capability – primarily riding on half precision compute and systolic arrays.

Abstract:   For a class of polynomials P,  a set of evaluation points H is said to be a hitting set if any nonzero polynomial P is nonzero on some point in H.