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/2014/newsitem/5494/24-
 January-2014-CWI-Algorithms-Complexity-seminar-Bil
 l-Fefferman-Caltech-
DTSTAMP:20140118T000000
SUMMARY:CWI Algorithms & Complexity seminar, Bill 
 Fefferman (Caltech)
ATTENDEE;ROLE=Speaker:Bill Fefferman (Caltech)
DTSTART;TZID=Europe/Amsterdam:20140124T140000
DTEND;TZID=Europe/Amsterdam:20140124T150000
LOCATION:CWI room L017, Science Park 123, Amsterda
 m
DESCRIPTION:How powerful are quantum computers? De
 spite the prevailing belief that quantum computers
  are more powerful than their classical counterpar
 ts, this remains a conjecture backed by little for
 mal evidence. In this talk, the author will addres
 s this question from two different perspectives.  
 Based on joint work with Chris Umans  For more inf
 ormation, see  or contact rdewolf at cwi.nl.
X-ALT-DESC;FMTTYPE=text/html:\n        <p>How powe
 rful are quantum computers?  Despite the prevailin
 g belief that quantum computers are more powerful 
 than their classical counterparts, this remains a 
 conjecture backed by little formal evidence.  In t
 his talk, the author will address this question fr
 om two different perspectives.</p>\n        <p>Bas
 ed on joint work with Chris Umans</p>\n    \n     
    <p>For more information, see <longdescritionref
  /> or contact <a class="email">rdewolf <span clas
 s="at">at</span> cwi.nl</a>.</p>\n    
URL:/NewsandEvents/Archives/2014/newsitem/5494/24-
 January-2014-CWI-Algorithms-Complexity-seminar-Bil
 l-Fefferman-Caltech-
END:VEVENT
END:VCALENDAR