Fall 2018

Algebraic Methods

Monday, Dec 3, 2018 to Friday, Dec 7, 2018 

Add to Calendar


Shubhangi Saraf (Rutgers University; chair), Amir Shpilka (Tel Aviv University), Madhu Sudan (Harvard University)
Algebraic methods are one of the most important tools in proving lower bounds for various computational models. They are prominent in communication complexity, quantum computation, study of AC^0 circuits, pseudorandomness and, most naturally, algebraic complexity. The topic of the workshop is algebraic techniques with a focus on algebraic complexity. Specifically, the workshop will present recent advances and developments and, in addition, the most approachable open problems.

Some specific topics to be covered include new techniques in proving lower bounds for arithmetic circuits, recent developments in the GCT program and some concrete open problems therein, recent advances in algebraic pseudorandomness, non-commutative models of computation, and the connection of all of these topics to areas such as proof complexity, analysis, geometry and combinatorics.

Invited Participants: 

Eric Allender (Rutgers University), Vikraman Arvind (Institute of Mathematical Sciences), Paul Beame (University of Washington), Vishwas Bhargava (Rutgers), Markus Bläser (Universität des Saarlandes), Mark Bun (Princeton University), Peter Bürgisser (Institute of Mathematics, TU Berlin), Igor Carboni Oliveira (University of Oxford), Marco Carmosino (UC San Diego), Arkadev Chattopadhyay (Tata Institute of Fundamental Research), Lijie Chen (MIT), Susanna de Rezende (KTH Royal Institute of Technology), Klim Efremenko (Ben Gurion University), Yuval Filmus (Technion - Israel Institute of Technology), Michael Forbes (University of Illinois at Urbana-Champaign), Anna Gál (University of Texas at Austin), Venkata Gali (UC San Diego), Ankit Garg (Microsoft Research India), Leonid Gurvits (City University of New York), Johan Håstad (KTH), Hamed Hatami (McGill University), Shuichi Hirahara (The University of Tokyo), Pavel Hrubes (Academy of Sciences of the Czech Republic), Xuangui Huang (Northeastern University), Christian Ikenmeyer (Max-Planck-Institut für Informatik), Russell Impagliazzo (UC San Diego), Valentine Kabanets (Simon Fraser University), Dick Karp (UC Berkeley), Neeraj Kayal (Microsoft Research India), Pascal Koiran (Ecole Normale Supérieure de Lyon), Antonina Kolokolova (Memorial University of Newfoundland), Sajin Koroth (University of Haifa), Mrinal Kumar (Harvard University), Nutan Limaye (Indian Institute of Technology Bombay), Meena Mahajan (Institute of Mathematical Sciences), Guillaume Malod (Universite Paris Diderot), Or Meir (University of Haifa), Rafael Mendes de Oliveira (University of Toronto), Ian Mertz (University of Toronto), Andrew Morgan (University of Wisconsin, Madison), Ketan Mulmuley (University of Chicago), Cody Murray (MIT), Jakob Nordström (KTH Royal Institute of Technology), Greta Panova (University of Pennsylvania), Natacha Portier (Ecole Normale Supérieure de Lyon), Youming Qiao (University of Technology, Sydney), Robert Robere (University of Toronto), Ben Rossman (University of Toronto), Chandan Saha (Indian Institute of Science), Ramprasad Saptharishi (Tata Institute of Fundamental Research, Mumbai), K. V. Subrahmanyam (Chennai Mathematical Institute), Joseph Swernofsky (KTH), Avishay Tal (Stanford University), Dieter Van Melkebeek (U Wisconsin-Madison), Umesh Vazirani (UC Berkeley), Ben Lee Volk (Technion Israel Institute of Technology), Ilya Volkovich (University of Michigan), Avi Wigderson (Institute for Advanced Study), Virginia Williams (MIT), Ryan Williams (MIT), Amir Yehudayoff (Technion Israel Institute of Technology)