Dear organizers and participants,

I would like to invite you to the doctoral seminar on this Thursday at 9:50 in S6. I will present a paper:

Cody D. Murray, Ryan Williams: On the (Non) NP-Hardness of Computing Circuit Complexity http://eccc.hpi-web.de/report/2014/164/download/

Basic knowledge of computational complexity is recommended -- at least classes like P, NP, RP, BPP, EXP, AC0 and some notion of reducibility. Knowledge of relations among foremetioned class will be helpful too to put the article into a bigger picture.

Best regards,

Radek Hušek