14 June 2007, USCKI Incognito Symposium "P = NP, how hard can it be?", Went Blauw (Uithof), Utrecht University

On the 14th of June the students association for Cognitive Artificial Intelligence (CKI) at Utrecht University will hold its annual symposium. This year's symposium will focus on the famous mathematical question whether the complexity class P equals NP. In four talks we shall try to gain some insight into the problem from different perspectives, varying from cryptography to quantum logic.

These are the topics:
- Prof. Dr. Jan van Leeuwen, UU: "The history of the P vs. NP problem."
- Dr. Eike Kiltz, CWI Amsterdam: "P vs. NP in Cryptography. Which World Are We Living In?"
- Dr. Joost Joosten, ILLC/UvA: "Looking for hay in a haystack."
- Dr. Elham Kashefi, Oxford UK: "A quantum complexity tour."
Chairman of the day will be Prof. Dr. Pieter Adriaans (UvA).

For more information, see http://symposium.uscki.nl or contact symposium at uscki.nl.