Course: Topics in Computing (CS5160)

Topics in Computing (CS5160)

Lectures	Monday (14:30hrs--15:55hrs) and Thursday (16:00hrs--17:25hrs)
Venue	B-114
	GMeet (This course is being taught in hybrid mode at IIIT-Raichur.)

Introduction to Decision Trees/ Query Complexity.
Boolean functions and Combinatorial measures.
Analysis of Boolean functions.
Topics at the intersection of Decision Trees, Boolean functions and Fourier Analysis.

We will mostly follow technical papers. However, the following references might be of help.
H. Buhrman and R. de Wolf (2002), Complexity Measures and Decision Tree Complexity: A Survey.
S. Jukna (2011), Boolean Function Complexity.
R. O'Donnell (2014), Analysis of Boolean Functions.