## Speaker:

## Organisers:

## Time:

## Venue:

A two-player game is an important construct used in proving many hardness of approximation results.

Rakesh Venkat

Friday, 24 February 2017, 16:00 to 17:30

A two-player game is an important construct used in proving many hardness of approximation results.

Speaker:

Sayantan Chakraborty, TIFR

Friday, 17 February 2017, 16:00 to 17:30

The usual idea of compactness of a space is that if the space has an open cover then it has a finite subcover which is not very intuitive. In this talk we attempt to look at some equivalent characterisations of compact spaces.

Speaker:

Siddharth Bhandari, TIFR

Friday, 10 February 2017, 16:00 to 17:30

I will present a technique know as fast subset convolution for Exact Exponential Algorithms.

Speaker:

Piyush Srivastava, TIFR

Friday, 27 January 2017, 16:00 to 17:30

Consider a system consisting of a binary "stimulus" variable X, (e.g. whether an individual consumes tobacco), a binary "response" variable Y, (e.g.

Speaker:

Kshitij Gajjar, TIFR

Friday, 20 January 2017, 16:00 to 17:30

An n × n Latin square is a grid with n rows and n columns such that each cell of the grid is filled with one number from the set {1,2,...n} and no number is repeated in any row or any column.

Speaker:

Abhishek Singh, TIFR

Friday, 13 January 2017, 16:00 to 17:30

A graph is said to be perfect if the chromatic number of every induced subgraph equals its clique number.

Swagato Sanyal

Friday, 6 January 2017, 16:00 to 17:30

Linear sketch complexity of a Boolean function f on a set of n inputs, introduced by Kannan, Mossel and Yaroslavtsev, is, in informal terms, the smallest integer d such that the value of the function can be concluded with high probability from the

Speaker:

Suhail Sherif, TIFR

Friday, 30 December 2016, 16:00 to 17:30

Lee and Zhang showed that the communication complexity of "f composed with g" is high when f is hard to approximate with a low degree polynomial (also g has to be from a good class of functions, more details will be given in the talk).

Speaker:

Sagnik Mukhopadhyay, TIFR

Friday, 2 December 2016, 16:00 to 17:30

We will consider the problem of elimination in communication complexity, that was first raised by Ambainis et al. and later studied by Beimel et al. for its connection to the famous direct sum question.

Speaker:

Tulasi mohan Molli, TIFR

Friday, 25 November 2016, 16:00 to 17:30

The isoperiemtric profile of a Graph is a function that measures, for an integer k, is the size of the smallest edge boundary over all sets of vertices of size k.