BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2007/newsitem/1868/14-
 June-2007-USCKI-Incognito-Symposium-P-=-NP-how-har
 d-can-it-be-Went-Blauw-Uithof-Utrecht-University
DTSTAMP:20070531T000000
SUMMARY:USCKI Incognito Symposium "P = NP, how har
 d can it be?", Went Blauw (Uithof), Utrecht Univer
 sity
DTSTART;VALUE=DATE:20070614
DTEND;VALUE=DATE:20070614
LOCATION:Went Blauw (Uithof), Utrecht University
DESCRIPTION:On the 14th of June the students assoc
 iation for Cognitive Artificial Intelligence (CKI)
  at Utrecht University will hold its annual sympos
 ium. This year's symposium will focus on the famou
 s mathematical question whether the complexity cla
 ss P equals NP. In four talks we shall try to gain
  some insight into the problem from different pers
 pectives, varying from cryptography to quantum log
 ic.   These are the topics:  - Prof. Dr. Jan van L
 eeuwen, UU: "The history of the P vs. NP problem."
   - Dr. Eike Kiltz, CWI Amsterdam: "P vs. NP in Cr
 yptography. Which World Are We Living In?"  - Dr. 
 Joost Joosten, ILLC/UvA: "Looking for hay in a hay
 stack."  - Dr. Elham Kashefi, Oxford UK: "A quantu
 m complexity tour."  Chairman of the day will be P
 rof. Dr. Pieter Adriaans (UvA).    For more inform
 ation, see http://symposium.uscki.nl or contact sy
 mposium at uscki.nl.
X-ALT-DESC;FMTTYPE=text/html:\n      <p>\n        
 On the 14th of June the students association for C
 ognitive Artificial Intelligence (CKI) at Utrecht 
 University will hold its annual symposium. This ye
 ar's symposium will focus on the famous mathematic
 al question whether the complexity class P equals 
 NP. In four talks we shall try to gain some insigh
 t into the problem from different perspectives, va
 rying from cryptography to quantum logic.\n      <
 /p>\n    <p>These are the topics:<br />\n- Prof. D
 r. Jan van Leeuwen, UU: &quot;The history of the P
  vs. NP problem.&quot;<br />\n- Dr. Eike Kiltz, CW
 I Amsterdam: &quot;P vs. NP in Cryptography. Which
 \nWorld Are We Living In?&quot;<br />\n- Dr. Joost
  Joosten, ILLC/UvA: &quot;Looking for hay in a hay
 stack.&quot;<br />\n- Dr. Elham Kashefi, Oxford UK
 : &quot;A quantum complexity tour.&quot;<br />\nCh
 airman of the day will be Prof. Dr. Pieter Adriaan
 s (UvA).\n   </p>\n    \n      <p>\n        For mo
 re information, see <a target="_blank" href="http:
 //symposium.uscki.nl">http://symposium.uscki.nl</a
 >\nor contact <a class="email">symposium <span cla
 ss="at">at</span> uscki.nl</a>.\n      </p>\n    
URL:/NewsandEvents/Archives/2007/newsitem/1868/14-
 June-2007-USCKI-Incognito-Symposium-P-=-NP-how-har
 d-can-it-be-Went-Blauw-Uithof-Utrecht-University
END:VEVENT
END:VCALENDAR