• Click on the titles of individual talks for abstract, slides and archived video.

–
Coffee and Check-In
–
Opening Remarks
–
Invariant Theory for Computer Scientists
Avi Wigderson (Institute for Advanced Study, Princeton)
–
Break
–
The GCT Program: Recent Developments and Some Concrete Open Problems
Ketan Mulmuley (The University of Chicago)
–
Lunch
–
Geometric Complexity Theory: No Occurrence Obstructions for Determinant vs Permanent
Peter Bürgisser (Technical University of Berlin)
–
Break
–
Orbits of Monomials and Factorization into Products of Linear Forms
Pascal Koiran (École Normale Supérieure de Lyon)
–
Proof Complexity Lower Bounds from Graph Expansion and Combinatorial Games
Jakob Nordström (University of Copenhagen & Lund University)
–
Coffee and Check-In
–
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
Virginia Williams (Massachusetts Institute of Technology)
–
Break
–
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree
Vishwas Bhargava (Rutgers University)
–
An Instance of Symbolic Determinant Identity Testing via *-algebras
Youming Qiao (University of Technology, Sydney)
–
Lunch
–
Kronecker and Plethysm Coefficients in Geometric Complexity Theory: Permanent vs Determinant and Matrix Powering
Greta Panova (University of Pennsylvania)
–
Break
–
Recent Progress on Representation Theoretic Multiplicities in GCT
Christian Ikenmeyer (University of Warwick)
–
Generalized Matrix Completion and Algebraic Natural Proofs
Markus Bläser (Universität des Saarlandes)
–
Reception
–
Coffee and Check-In
–
Proper Learning Algorithms from Lower Bounds for Arithmetic Circuits
Neeraj Kayal (Microsoft Research India)
–
Break
–
Fine-Grained Algorithms and Complexity of Solving Polynomial Systems of Equations
Ryan Williams (MIT)
–
An Improved Depth Reduction for Syntactically Multilinear Circuits
Mrinal Kumar (Harvard University)
–
Lunch
–
Reconstruction of Non-Degenerate Homogeneous Depth Three Circuits
Chandan Saha (Indian Institute of Science)
–
Break
–
A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits
Michael Forbes (University of Illinois at Urbana-Champaign)
–
Algebraic Dependence is Not Hard (& Filling the GCT Chasm)
Nitin Saxena (IIT Kanpur)
–
Open Problem Session
–
Coffee and Check-In
–
Analyzing Alternating Minimization Algorithms Using Algebraic Methods
Ankit Garg (Princeton University)
–
PIT Questions in Invariant Theory
Rafael Mendes de Oliveira (University of Toronto)
–
Break
–
Complete Derandomization of Identity Testing of Read-Once Formulas
Ilya Volkovich (University of Michigan)
–
Formal Series and Non-Commutative Computations
Guillaume Malod (Université Paris Diderot)
–
Lunch
–
Barriers for Rank Methods in Arithmetic Complexity
Klim Efremenko (Ben Gurion University)
–
Break
–
Generic vs Symbolic Behaviour, and Power Series Expansion
Visu Makam (Institute for Advanced Study)
–
Near-Optimal Bootstrapping of Hitting Sets
Ramprasad Saptharishi (Tata Institute of Fundamental Research, Mumbai)
–
Coffee and Check-In
–
Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications
Nutan Limaye (Indian Institute of Technology Bombay)
–
Break
–
Complexity of Separation of Variables and Splitting of Monomials
Leonid Gurvits (City University of New York)
–
Lunch
–
Torus Quotients in the Grassmannian
K. V. Subrahmanyam (Chennai Mathematical Institute)
–
Break
–
Fast Exact Algorithms Using Hadamard Product of Polynomials
Vikraman Arvind (Institute of Mathematical Sciences)