Seminar • Algorithms and Complexity — Can Algebraic Circuit Lower Bounds Have Easy Proofs?
Please note: This seminar will be given online.
Anamay Tengse
Tata Institute of Fundamental Research (TIFR)
Anamay Tengse
Tata Institute of Fundamental Research (TIFR)
Ershad Banijamali, PhD candidate
David R. Cheriton School of Computer Science
Amit Levi, PhD candidate
David R. Cheriton School of Computer Science
Vijay Menon, PhD candidate
David R. Cheriton School of Computer Science
Hong Zhou, PhD candidate
David R. Cheriton School of Computer Science
Bryce Sandlund, PhD candidate
David R. Cheriton School of Computer Science
Sebastian Verschoor, PhD candidate
David R. Cheriton School of Computer Science
Pan Li
Stanford University
Chris White
Microsoft Research
Shenghao Yang
Kimon Fountoulakis
University of Waterloo
Aida Sheshbolouki, PhD candidate
David R. Cheriton School of Computer Science
Anindya De, Department of Computer and Information Science
University of Pennsylvania