Please note that this newsitem has been archived, and may contain outdated information or links.
21 January 2014, PhD defense, Bruno Loff
Candidate: Bruno Loff
Title: A Medley for Computational Complexity. With Applications of Information Theory, Learning Theory, and Ketan Mulmuley's Parametric Complexity Technique.
Date: Tuesday 21 January 2014
Time: 10:00-12:30
Location: Agnietenkapel, Oudezijds Voorburgwal 231, Amsterdam
Promotor: Prof.dr. Harry Buhrman
For more information, see http://www.uva.nl/binaries/content/assets/uva/nl/onderzoek/promoveren/
Please note that this newsitem has been archived, and may contain outdated information or links.