## Organisers:

## Time:

## Venue:

We look at the boolean function in which the input is a boolean matrix with the promise that either 2/3rd of its rows contain a 1 or 2/3rd of its rows do not contain a 1.

Speaker:

Suhail Sherif, TIFR

Friday, 28 July 2017,

17:15 to 18:15

We look at the boolean function in which the input is a boolean matrix with the promise that either 2/3rd of its rows contain a 1 or 2/3rd of its rows do not contain a 1.

Speaker:

Anand Deo, TIFR

Friday, 21 July 2017,

17:15 to 18:15

Discrete default intensity based or logit type models are commonly used as reduced form models for conditional default probabilities for corporate loans where this default probability depends upon macroeconomic as well as firm-specific covariates.

Speaker:

Varun Narayanan, TIFR

Friday, 30 June 2017,

17:15 to 18:15

We discuss the notion of security in the multi-party computing protocols. We start with the simpler definition of standalone security.

Speaker:

Anamay Tengse, TIFR

Friday, 23 June 2017,

17:15 to 18:15

Nisan gave an exact characterization of the ``non-commutative algebraic branching program (ABP) complexity'' of a polynomial in 1991.

Santhoshini Velusamy

Friday, 16 June 2017,

17:15 to 18:15

This paper is joint work with Venkatesan Guruswami and Ameya Vellingker, to appear in APPROX 17.

Speaker:

Suhail Sherif, TIFR

Friday, 9 June 2017,

17:15 to 18:15

Around a week ago, a group of researchers* proved that the randomized query complexity of f composed with g is lower bounded by the product of the randomized query complexities of f and g, albeit with suboptimal parameters.

Rakesh Pawar

Friday, 2 June 2017,

17:15 to 18:15

In this talk, we will see a proof of the snake lemma. The talk will assume a basic familiarity (group homomorphisms, kernels, cokernels, etc.) with group theory.

Speaker:

Ramprasad Saptharishi, TIFR

Friday, 26 May 2017,

17:15 to 18:15

During academic collaborations, we have different people working on a paper and the draft has a natural evolution. Most people are ok using a sync service like dropbox, or even just emailing tex sources to each other (gasp).

Speaker:

Prerona Chatterjee, TIFR

Friday, 19 May 2017,

17:15 to 18:15

In this talk, we look at a $n^1.6616$ lower bound for SAT on $n^{o(n)}$ space machines. The result is taken from the 2006 paper by Ryan Williams.

Shubhada Agrawal

Friday, 12 May 2017,

17:15 to 18:15

An individual is faced with several options while deciding to invest in a financial market. Some opportunities giving higher returns but carrying more risk while some being less risky and give lower returns.