| Title | : | Complexity measures of Boolean functions |
| Speaker | : | Swagato Sanyal (NUS & NTU Singapore) |
| Details | : | Mon, 4 Dec, 2017 11:00 AM @ A M Turing Hall |
| Abstract: | : | In this talk, I shall introduce the query model and various query complexity measures of Boolean functions. I shall present a few recent results on the role of randomness in the query model, separation amongst various query complexity measures of Boolean functions, and a composition theorem of randomized query complexity. Speaker Bio : Swagato Sanyal is currently a post-doctoral researcher at Center for Quantum Technologies (NUS) & NTU Singapore. He finished his PhD from TIFR Mumbai in Jan 2017 where he won the TIFR Alumni Association-Sasken Award in Computer Science (Best Thesis Award) for the year 2016-17. His research interests are in theoretical computer science in general, and computational complexity theory in particular. He has worked in in Analysis of Boolean functions, Complexity Measures of Boolean functions and Communication Complexity. |
