video lecture CSDM - On P vs NP, Geometric Complexity Theory, and the Riemann Hypothesis - Part I February 09, 2009 Ketan Mulmuley Read More
video lecture Pseudorandomness - Substitution sequences at primes December 03, 2008 Peter Sarnak Read More
video lecture Pseudorandomness - When do sparse sets have dense models? December 03, 2008 Russell Impagliazzo Read More
video lecture Pseudorandomness - Exponential sums, equidistribution and pseudo-randomness December 03, 2008 Jean Bourgain Read More
video lecture Pseudorandomness in Mathematics and Computer Science Mini-Workshop December 03, 2008 In math, one often studies random aspects of deterministic systems and structures. In CS, one often tries to efficiently create structures and systems with specific random-like properties. Recent work has shown many connections between these two... Read More
video lecture CSDM - Lower Bounds for Circuits with $MOD_m$ Gates October 07, 2008 Arkadev Chattopadhyay Let $CC_{o(n)} \left[ m \right]$ be the class of circuits that have size $o(n)$ and in which all gates are $MOD_m$ gates. --We show that $CC[m]$ circuits cannot compute $MOD_q$ in sub-linear size when $m, q \ge 1$ are co-prime integers. No non... Read More
video lecture Lower Bounds for Circuits with $MOD_m$ Gates - Part II October 07, 2008 Arkadev Chattopadhyay Read More
video lecture Lower Bounds for Circuits with $MOD_m$ Gates - Part I October 07, 2008 Arkadev Chattopadhyay Read More