## Time:

## Venue:

**Abstract: **We study the complexity of simulating a neural network. We simplified the model of a neural network as a directed graph $G(V,E)$, where the nodes represent the neurons.

Speaker:

Vidya Sagar Sharma, TIFR

Friday, 27 December 2019, 17:15 to 18:15

**Abstract: **We study the complexity of simulating a neural network. We simplified the model of a neural network as a directed graph $G(V,E)$, where the nodes represent the neurons.

S. Venkitesh

Friday, 6 December 2019, 14:30 to 15:30

**Abstract:** The probabilistic degree of a Boolean function f is defined to be the smallest d such that there is a random polynomial P of degree at most d that agrees with f at each point with high probability.

Speaker:

Anamay Tengse, TIFR

Friday, 29 November 2019, 17:15 to 18:15

**Abstract: **Say we are "given" a set of matrices S, such that for any two matrices A and B from S, we have AB=BA. What kind of "structure" can we assume for the matrices in S?

Speaker:

Kumar Saurav, TIFR

Friday, 22 November 2019, 17:15 to 18:15

**Abstract: **In distributed IoT paradigm, we often have cases where multiple nodes need to keep a common server updated with their status information.

Speaker:

Prabhat Kumar Jha, TIFR

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

**Abstract: **Given an $n \times n$ rational matrix A, a vector $u \in \mathbb{Q}^n$ and an affine subspace $W \subset \mathbb{Q}^n$ , the affine subspace reachability problem asks whether there exists $t \in \mathbb{N}$ such that $A

Speaker:

Suhail Sherif, TIFR

Friday, 8 November 2019, 17:15 to 18:15

**Abstract: **The year was 1953. Rajendra Prasad was still the president of India after winning the presidential election one year prior.

Speaker:

Anirban Bhattacharjee, TIFR

Friday, 18 October 2019, 17:15 to 18:15

**Abstract:** In a multi-armed bandit problem a gambler needs to choose at each round one of K arms, each characterized by an unknown reward distribution.

Kshitij Gajjar (IIIT Delhi) and Prerona Chatterjee (STCS, TIFR)

Friday, 11 October 2019, 17:15 to 18:15

**Abstract: **In this talk, we will explore a surprising connection between graph theory and convex geometry. We look at graphs whose edge weights are linear forms in $d$ variables.

Speaker:

Gunjan Kumar, TIFR

Friday, 4 October 2019, 17:15 to 18:15

**Abstract: **Given n jobs with release dates, deadlines and processing times we consider the problem of scheduling them on m parallel machines so as to minimize the total energy consumed.

Speaker:

Prerona Chatterjee, TIFR

Friday, 13 September 2019, 17:15 to 18:15

Abstract: A polynomial is said to be multilinear if the individual degree of every variable is at most one in any monomial; and is said to be homogeneous if every monomial in it has the same degree.