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/2013/newsitem/4869/6-F
ebruary-2013-General-Mathematics-Colloquium-Jop-Br
iët-CWI-
DTSTAMP:20130203T000000
SUMMARY:General Mathematics Colloquium, Jop Briët
(CWI)
ATTENDEE;ROLE=Speaker:Jop Briët (CWI)
DTSTART;TZID=Europe/Amsterdam:20130206T111500
DTEND;TZID=Europe/Amsterdam:20130206T121500
LOCATION:C1.112
DESCRIPTION:Abstract. Grothendieck's inequality i
s a fundamental result to the theory of Banach spa
ces. But many years after Grothendieck published t
his result, people realized that it also has impor
tant applications in theoretical computer science
and physics. In particular, the inequality can be
used in quantum information theory to study the my
sterious phenomenon of quantum entanglement and in
combinatorial optimization to prove performance g
uarantees of efficient approximation algorithms fo
r NP-hard problems. The aim of this talk is to giv
e an overview of these applications and explain wh
y Grothendieck's inequality and recent generalizat
ions of it are powerful mathematical tools to stud
y them. The General Mathematics Colloquium home
page can be found at http://www.science.uva.nl/res
earch/math/Calendar/colloq/
X-ALT-DESC;FMTTYPE=text/html:\n \n
*Abstract*.

\n Grothendieck's ineq
uality is a fundamental result to the\n the
ory of Banach spaces. But many years after Grothen
dieck\n published this result, people reali
zed that it also has\n important applicatio
ns in theoretical computer science and\n ph
ysics. In particular, the inequality can be used i
n quantum\n information theory to study the
mysterious phenomenon of\n quantum entangl
ement and in combinatorial optimization to\n
prove performance guarantees of efficient approx
imation\n algorithms for NP-hard problems.
The aim of this talk is to\n give an overvi
ew of these applications and explain why\n
Grothendieck's inequality and recent generalizatio
ns of it are\n powerful mathematical tools
to study them.\n

\n \n \n
The General Mathematics Colloquium homepage can
be found at\nhtt
p://www.science.uva.nl/research/math/Calendar/coll
oq/\n

\n
URL:/NewsandEvents/Archives/2013/newsitem/4869/6-F
ebruary-2013-General-Mathematics-Colloquium-Jop-Br
iët-CWI-
END:VEVENT
END:VCALENDAR