TIN 085: Selected Topics in Computational Complexity I
Boolean Function Complexity

Time: Every Friday, 10:40am-12:10pm       Venue: Corridor S321 (opposite to room #324)

Course Description

Boolean functions are perhaps the most basic objects of study in the domain of theoretical computer science. In this course we will discuss analysis of Boolean functions and various applications in several areas like property testing, circuit complexity, learning theory, pseudorandomness.





For any clarification regarding the course, feel free to meet me anytime at Room #324 or drop me an e-mail at <firstname> at iuuk dot mff dot cuni dot cz.