Advanced Topics of Algorithmics: Complexity of Boolean Functions (MA-INF 1302)


Is P = NP? This is the most famous open problem in computer science. A popular approach to attack this problem is to look for a proof of a nonpolynomial lower bound for the circuit complexity of the characteristic function of a language in NP. But no nonlinear lower bound for such a function is known. Can we multiply two integers in linear time or can we prove an Ω(n log n) lower bound for the circuit complexity of the multiplication of two n-bit numbers? Understanding the power of negations is one of the most challenging problems of computer science. The main topic of this lecture is the development of techniques for proving lower bounds for the complexity of Boolean functions.


Art When Where Start Lecturer
V4 Monday 14:15 - 15:45
Wednesday 08:15 - 09:45
CP1-HSZ / Hörsaal 4
CP1-HSZ / Hörsaal 4
09. April 2018 Prof. Dr. N. Blum
Ü2 Wednesday 12:00 - 13:30 Room 2.050 17. April 2018 Schmitz


The 1st oral examination will be held on the 17th of July in room 2.058. To get your exact examination time, please write an e-mail to Adrian Schmitz.

Lecture Notes

There is an error in the page numbering in the 6th lecture notes. The page number 152 is page number 154 and vice versa.


Tutorial presence and exercise sheets are voluntary, but recommended. You can choose freely the tutorial group to participate and you do not have to hand in the solution of the exercise sheets. Also, there are no other requirements to take part in the oral examination as to register in BASIS.


Page Tools