https://www.dagstuhl.de/20381

### September 13 – 18 , 2020, Dagstuhl Seminar 20381

# CANCELLED Algebraic and Analytic Methods in Computational Complexity

Due to the Covid-19 pandemic, this seminar was cancelled.

## Organizers

Markus Bläser (Universität des Saarlandes – Saarbrücken, DE)

Valentine Kabanets (Simon Fraser University – Burnaby, CA)

Ronen Shaltiel (University of Haifa, IL)

Jacobo Torán (Universität Ulm, DE)

## For support, please contact

Susanne Bach-Bernhard for administrative matters

Andreas Dolzmann for scientific matters

## Motivation

Computational Complexity is concerned with the resources that are required for algorithms to detect properties of combinatorial objects and structures. It has often proven true that the best way to argue about these combinatorial objects is by establishing a connection (perhaps approximate) to a more wellbehaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques. The Razborov-Smolensky polynomial-approximation method for proving constant-depth circuit lower bounds, the PCP characterization of NP, and the Agrawal-Kayal-Saxena polynomial-time primality test are some of the most prominent examples.

The algebraic theme continues in some of the most exciting recent progress in computational complexity. There have been significant recent advances in algebraic circuit lower bounds, and the socalled "chasm at depth 4" suggests that the restricted models now being considered are not so far from ones that would lead to a general result. There have been similar successes concerning the related problems of polynomial identity testing and circuit reconstruction in the algebraic model (and these are tied to central questions regarding the power of randomness in computation).

Another surprising connection is that the algebraic techniques invented to show lower bounds now prove useful to develop efficient algorithms. For example, Williams showed how to use the polynomial method to obtain faster all-pair-shortest-path algorithms.

Beside algebraic methods, analytic methods have been used for quite some time in theoretical computer science. Very recently, Fourier analysis was essential for proving a variant of the famous Unique Games Conjecture, the so-called 2-2 Conjecture.

Analytic methods can also be used to solve algebraic problems. Garg et al. use analytic scaling algorithms to solve problems from algebra, so-called orbit closure problems, by using geometric invariant theory to establish the link. Central problems, like the tensor border rank or non-commutative identity testing, can be written as such an orbit closure problem.

These new directions will be in the focus of the Dagstuhl Seminar and reflect the developments in the field since the previous Dagstuhl Seminar 18391. Taking the recent exciting developments outlined above into account, we also include analytic methods this time.

This Dagstuhl Seminar aims to capitalize on recent progress and bring together researchers who are using a diverse array of algebraic and analytic methods in a variety of settings. Researchers in these areas are relying on ever more sophisticated and specialized mathematics and this seminar will play an important role in educating a diverse community about the latest new techniques, spurring further progress.

**Motivation text license**

Creative Commons BY 3.0 DE

Markus Bläser, Valentine Kabanets, Ronen Shaltiel, and Jacobo Torán

## Dagstuhl Seminar Series

- 18391: "Algebraic Methods in Computational Complexity" (2018)
- 16411: "Algebraic Methods in Computational Complexity" (2016)
- 14391: "Algebra in Computational Complexity" (2014)
- 12421: "Algebraic and Combinatorial Methods in Computational Complexity" (2012)
- 09421: "Algebraic Methods in Computational Complexity" (2009)
- 07411: "Algebraic Methods in Computational Complexity " (2007)
- 04421: "Algebraic Methods in Computational Complexity" (2004)
- 02421: "Algebraic Methods in Quantum and Classical Models of Computation" (2002)

## Classification

- Data Structures / Algorithms / Complexity

## Keywords

- Computational complexity
- Algebra
- Derandomization
- Circuits
- Coding theory