Theory Seminars

Day: Wednesdays (every alternate)
Time: 1700-1830 hrs (Indian Standard Time)

Quantum weirdness in query-to-communication simulation and the role of symmetry

Manaswi Paraashar, Indian Statistical Institute, Kolkata

A(n almost) Universal Algorithm for Global Minimum Cut

Sagnik Mukhopadhyay, University of Copenhagen, Denmark

QBF Solving: Advantages and disadvantages of different approaches

Gaurav Sood, IMSc, Chennai

Can Quantum Computers Outperform Gradient Descent?

Suhail Sherif, Vector Institute, Toronto

Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four

Suryajith Chillara, CSTAR, IIIT Hyderabad

Lower Bounds in Algebraic Circuit Complexity

Prerona Chatterjee, TIFR, Mumbai

Shortest Paths in Time-varying Networks

Kshitij Gajjar, School of Computing, National University of Singapore