## Organisers:

## Time:

## Venue:

In this talk we will look at $n$-variate polynomials that can be expressed as a small (poly$(n)$) sum of powers of linear polynomials. That is, polynomials that have efficient {\em depth-3-powering} circuits.

Speaker:

Anamay Tengse, TIFR

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

In this talk we will look at $n$-variate polynomials that can be expressed as a small (poly$(n)$) sum of powers of linear polynomials. That is, polynomials that have efficient {\em depth-3-powering} circuits.

Speaker:

Nikhil S Mande, TIFR

Tuesday, 17 April 2018, 16:00 to 17:30

Given a boolean function $f : \{0, 1\}^n \rightarrow \{0, 1\}$ define the function $f \circ \mathsf{XOR}$ on $2n$ bits by $f \circ \mathsf{XOR} (x_1, \dots, x_n, y_1, \dots, y_n) = f(x_1 \oplus y_1, \dots, x_n \oplus y_n)$. Such a function is cal

Speaker:

Suhail Sherif, TIFR

Friday, 13 April 2018, 16:00 to 17:00

A threshold function on n bits is a function that can be represented as the sign of a linear function of its inputs, i.e. f(x) = sign(w_1 x_1 + ... w_n x_n + c)

Sayan Bhattacharya

Friday, 13 April 2018, 11:45 to 12:45

Many real-world networks such as the ones arising out of facebook and twitter, webpages and hyperlinks etc. evolve with the passage of time.

Speaker:

Prerona Chatterjee, TIFR

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

A set of polynomials is said to be algebraically independent if there is no non-zero combination of them which is zero. Testing whether a given set of polynomials is algebraically independent efficiently is open in general.

Amitalok J. Budkuley

Tuesday, 27 March 2018, 14:30 to 15:30

In Shannon's classical rate distortion problem, an encoder compresses data from a source into a message and sends it losslessly to the decoder.

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 16 March 2018, 17:15 to 18:45

We discuss a technique that provides a sufficient condition for establishing a Markov chain on the joint distribution.

V.S. Borkar

Tuesday, 13 March 2018, 10:00 to 11:00

This talk will outline standard issues and results related to small noise limits in noise-perturbed dynamics and two important reasonsfor studying these, and illustrate the same by examples from the work ofthe speaker and his collaborators.

Thursday, 15 February 2018, 09:00 to Friday, 16 February 2018, 18:00

Speaker:

Subhashini Krishnasamy, TIFR

Tuesday, 13 February 2018, 17:00 to 18:00

Scheduling problems in queueing systems have been long studied under the assumption that the service rates are known a priori.

Dr.Piyush Srivastava joins the School of Technology and Computer Science as a Reader.Piyush's research is on probability in computer science and often concerns question

Dr. Ramprasad Saptharishi joins the School of Technology and Computer Science as a Reader. Ramprasad's research interests include Arithmetic complexity, pseudorandomness and derandomization.

- ‹ previous
- 4 of 16
- next ›