## Organisers:

## Time:

## Venue:

A probabilistic polynomial is like a randomized algorithm. It is a distribution on polynomials such that, for each input, the probabilistic polynomial computes the function exactly with high probability.

Speaker:

Tulasi mohan Molli, TIFR

Wednesday, 29 August 2018, 17:15 to 18:15

A probabilistic polynomial is like a randomized algorithm. It is a distribution on polynomials such that, for each input, the probabilistic polynomial computes the function exactly with high probability.

Vishwas Bhargava

Friday, 24 August 2018, 17:15 to 18:15

In this talk, we describe a new type of probabilistic algorithm (introduced by Gat and Goldwasser [GG11]) called Pseudo-deterministic Algorithms: a randomized algorithm which is guaranteed to run in expected polynomial time and to produce a correc

Prabhat Jha

Friday, 10 August 2018, 17:15 to 18:15

Abstract: We shall discuss the logical interpretation of Topology and Topological interpretations of various Logics.

Speaker:

Siddharth Bhandari, TIFR

Friday, 27 July 2018, 17:15 to 18:15

We will prove the following theorem which gives an alternate proof to the Erdős-Hanani conjecture.

Speaker:

Nikhil S Mande, TIFR

Friday, 20 July 2018, 17:15 to 18:15

Abstract:

We consider functions computable efficiently by "linear decision lists", which are decision lists where the queries are linear threshold functions.

Speaker:

Anand Deo, TIFR

Friday, 6 July 2018, 17:15 to 18:15

Consider a system with K arms, arm $i$ yielding a payoff $X_{i}$, according to the distribution $P_{i}$.

Speaker:

Aditya Nema, TIFR

Friday, 29 June 2018, 17:15 to 18:15

In this talk, we shall discuss the fully quantum Slepian Wolf theorem and it's proof (Winter et al).

Speaker:

Sayantan Chakraborty, TIFR

Friday, 22 June 2018, 17:15 to 18:15

We shall discuss classical rate distortion, i.e., message compression with a distortion criterion, in the one-shot setting with and without side information at the decoder. The rate distortion problem with side information at the decoder is also c

Speaker:

Kshitij Gajjar, TIFR

Friday, 15 June 2018, 17:15 to 18:15

Hansel's lemma (not Hensel's lemma) states that if the complete graph on $n$ vertices can be expressed as the union of $r$ bipartite graphs $B_1,B_2,\ldots,B_r$ such that $n_i$ is the number of non-isolated vertices in $B_i$, then $n_1+n_2+\cdots+

Speaker:

Anamay Tengse, TIFR

Friday, 25 May 2018, 17:15 to 18:15

Non-commutative algebraic circuits are those in which the variables do not commute under multiplication. Additionally, a circuit is called monotone if it does not use subtractions or negative constants.