SCHLOSS DAGSTUHL

(1)

Prof. Raimund Seidel, Ph.D.

Wissenschaftlicher Direktor Geschäftsstelle Schloss Dagstuhl Universität des Saarlandes Campus E1 1

66123 Saarbrücken | Germany Telefon +49 681 302 4396 Telefax +49 681 302 4397 www.dagstuhl.de [email protected]

Geschäftsanschrift Schloss Dagstuhl

Leibniz-Zentrum für Informatik GmbH Oktavie-Allee

66687 Wadern | Germany Vorsitzender des Aufsichtsrates Prof. Dr. -Ing. Dr. h. c. Stefan Jähnichen Geschäftsführung

Prof. Raimund Seidel, Ph.D.

Heike Meißner

Amtsgericht Saarbrücken HRB 63800 Ust.-IdNr. DE 137 972 446

Bank 1 Saar | BIC SABA DE 5S IBAN DE39 5919 0000 0005 1000 03

S C H L O S S D A G S T U H L

Leibniz-Zentrum für Informatik

Mitglied der Leibniz-Gemeinschaft

Dr. Samir Datta

Chennai Mathematical Institute PLOT H1

Siruseri, Sipcot IT-Park CHENNAI, 603103 INDIA

Saarbrücken, November 03, 2015 Invitation to the Dagstuhl Seminar 16411

Dear Dr. Datta:

As the Scientific Director of Schloss Dagstuhl, I would like to invite you to participate in a Dagstuhl Seminar onAlgebraic Methods in Computational Complexity. The seminar will be held at Schloss Dagstuhl in Germany at the following address: Oktavie-Allee, 66687 Wadern, fromSunday, October 09 to Friday, October 14, 2016. It is organized by the following international team of renowned researchers:

Valentine Kabanets(Simon Fraser University – Burnaby, CA) Thomas Thierauf(Hochschule Aalen, DE)

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

Christopher Umans(CalTech – Pasadena, US)

Schloss Dagstuhl is a non-profit association of eleven universities and research organizations. It is dedicated to the advancement of computer science. Since 1990, we have been hosting invitation-only Dagstuhl Seminars and Dagstuhl Perspectives Workshops that bring together the world’s leading researchers, practitioners, and young talents to discuss their ideas. Every year about two thousand of them meet in approximately fifty Dagstuhl Seminars and Dagstuhl Perspectives Workshops, fostering new directions and fields in computer science.

You can learn more about the seminar at http://www.dagstuhl.de/16411 and from the description accompanying this letter. The final program will be ar- ranged during the seminar. Although we invite you to give a talk, organizers may decide to limit the number of talks to provide enough room for discus- sions.

Some words about logistics: this is a 5-day seminar and we expect you to arrive on Sunday afternoon and depart the following Friday afternoon. The fee of 50 euro per day includes accommodation in a single room in our center, full board, and all taxes.

(2)

We would be delighted if you would agree to contribute to this Dagstuhl Sem- inar. Please return your registration form as soon as possible. Six weeks ahead of the seminar we will publish a list of participants on the seminar homepage at http://www.dagstuhl.de/16411 and send you detailed travel instructions by email.

If you have any questions, do not hesitate to contact us at [email protected].

Please include your seminar number 16411 in the subject line of all your mes- sages.

Sincerly yours,

Prof. Raimund Seidel, Ph.D.

Scientific Director

(3)

. . .

REGISTRATION FORM DAGSTUHL SEMINAR

: 16411

GUEST NUMBER

: 42329

Please complete, sign, and e-mail a scanned version of this form to [email protected]. Alternatively, you may fax it to +49 681 302-4397 (no cover sheets, please) or mail the original to the following address:

Geschäftsstelle Schloss Dagstuhl Universität des Saarlandes Campus E1 1

66123 SAARBRÜCKEN GERMANY

Title: Algebraic Methods in Computational Complexity Arrival Date: Sunday, October 09, 2016

Departure Date: Friday, October 14, 2016

Costs: 50 euro per day, includes full board in a single room. Payable at the end of stay.

Yes, I will attend Arrival / Departure date (if not as above)

If you must cancel your registration, please do sonolater than September 11, 2016.

No, I will not attend

Please correct and complete your guest record:

Title Mr. Ms. personal data

Family name Datta

First name Samir

Academic title Dr. Dr.-Ing. Prof. Prof. Dr. Prof. Dr.-Ing.

Date of birth / Nationality October 02, 1973 / IN

Name Chennai Mathematical Institute company/institution

Department PLOT H1

Address extension

Street Siruseri, Sipcot IT-Park

Post box

Zip code 603103

City Chennai

Country IN

Fax contact

E-mail [email protected]

Homepage http://www.cmi.ac.in/~sdatta/

Extras and remarks vegetarian extra long bed allergic to. . .

Date, Signature 2015-11-03, DG

(4)

Dagstuhl Seminar 16411

Algebraic Methods in Computational Complexity

October 10 - 14, 2016, Schloss Dagstuhl, Wadern, Germany Organizers:

Valentine Kabanets, Simon Fraser University – Burnaby, CA Thomas Thierauf, Hochschule Aalen, DE

Jacobo Torán, Universität Ulm, DE

Christopher Umans, CalTech – Pasadena, US

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 well-behaved 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 so-called 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. This emphases once again the central role of algebra in computer science.