## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

We study the size blow-up that is necessary to convert an algebraic circuit of constant product-depth D+1 to one of product-depth D in the multilinear setting.

Srikanth Srinivasan

Tuesday, 5 December 2017, 16:00 to 17:00

We study the size blow-up that is necessary to convert an algebraic circuit of constant product-depth D+1 to one of product-depth D in the multilinear setting.

Irit Dinur

Tuesday, 5 December 2017, 11:30 to 12:30

Nisan and Szegedy showed that low degree Boolean functions are juntas, namely, they depend only on a constant number of their variables.

Speaker:

Prahladh Harsha, TIFR

Thursday, 30 November 2017, 11:30 to 12:30

Agreement tests are a generalization of low degree tests that capture a local-to-global phenomenon, which forms the combinatorial backbone of most PCP constructions. In an agreement test, a function is given by an ensemble of local restrictions.

Lalitha Sankar

Thursday, 21 December 2017, 11:00 to 12:00

Preserving the utility of published datasets while simultaneously providing provable privacy guarantees is a well-known challenge.

Nutan Limaye

Tuesday, 28 November 2017, 16:00 to 17:00

The complexity of Iterated Matrix Multiplication is a central theme in Computational Complexity theory, as the problem is closely related to the problem of separating various complexity classes within $P$.

Speaker:

Sayantan Chakraborty, TIFR

Friday, 24 November 2017, 17:15 to 18:15

Entanglement is an important resource in quantum communication protocols and as such the problem of turning a preshared entangled state between two parties Alice and Bob into a Bell state has been studied extensively.

Kavita Ramanan

Thursday, 21 December 2017, 16:00 to 17:00

The standard hard-core model on a locally finite graph describes a family of Gibbs specifications, parameterized by the so-called activity parameter. An important problem is to determine when the model has a unique Gibbs measure and when it exhib

Anand Srivastav

Monday, 27 November 2017, 10:15 to 11:15

We study the problem of finding an Euler tour in an undirected graph $G$ in the W-Streaming model with $\mathcal{O}(n\,\textrm{polylog}(n))$ RAM, where $n$ resp.\ $m$ is the number of nodes resp.\ edges of $G$. Our main result is the first one pa

Speaker:

Marc Vinyals, TIFR

Friday, 17 November 2017, 17:15 to 18:15

Propositional proof complexity is the study of the resources that are needed to prove formulas in propositional logic.

Speaker:

Varun Narayanan, TIFR

Friday, 10 November 2017, 17:15 to 18:15

We would discuss the lower bound on the joint entropy of pairwise independent random variables (X_1, ... , X_n) by Lazlo Babai (2013).