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

Abstract: The classical Ulam’s problem asks about the length of a longest increasing subsequence in a uniform random permutation.

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: A cyclic order on a set X is a ternary relation on X satisfying three conditions called cyclicity, asymmetry and transitivity. These can be thought of as analogues of partial orders.