{"id":1251,"date":"2013-01-29T09:32:24","date_gmt":"2013-01-29T14:32:24","guid":{"rendered":"https:\/\/scottaaronson.blog\/?p=1251"},"modified":"2016-12-10T04:45:40","modified_gmt":"2016-12-10T09:45:40","slug":"tcs-online-seminars","status":"publish","type":"post","link":"https:\/\/scottaaronson.blog\/?p=1251","title":{"rendered":"TCS+ online seminars"},"content":{"rendered":"<p>Good news, everyone!\u00a0 Anindya De, Oded Regev, and my postdoc Thomas Vidick are launching an online theoretical computer science seminar series called <a href=\"http:\/\/mycqstate.wordpress.com\/2013\/01\/27\/tcs-online-seminars\/\"><strong>TCS+<\/strong><\/a>, modeled after the successful <a href=\"https:\/\/sites.google.com\/site\/plusquant\/\">Q+ quantum information seminars<\/a> run by Daniel Burgarth and Matt Leifer.\u00a0 The inaugural TCS+ lecture will be on Wednesday Feb. 6, at noon Eastern Standard Time.\u00a0 <a href=\"http:\/\/homepages.cwi.nl\/~rdewolf\/\">Ronald de Wolf<\/a>, longtime friend both of this blog and of its author, will be speaking on <a href=\"http:\/\/homepages.cwi.nl\/~rdewolf\/publ\/qc\/stoc130-fiorini.pdf\">Exponential Lower Bounds for Polytopes in Combinatorial Optimization<\/a>, his STOC&#8217;2012 Best Paper with Samuel Fiorini, Serge Massar, Sebastian Pokutta and Hans Raj Tiwary.\u00a0 This is the paper that used ideas originally from quantum communication complexity to solve a 20-year-old problem in classical optimization: namely, to rule out the possibility of proving P=NP by reducing the Traveling Salesman Problem to certain kinds of linear programs.\u00a0 Ronald previously gave the talk at MIT, and it rocked.\u00a0 See <a href=\"http:\/\/mycqstate.wordpress.com\/2013\/01\/27\/tcs-online-seminars\/\">Thomas&#8217;s blog<\/a> for details about how to watch.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Good news, everyone!\u00a0 Anindya De, Oded Regev, and my postdoc Thomas Vidick are launching an online theoretical computer science seminar series called TCS+, modeled after the successful Q+ quantum information seminars run by Daniel Burgarth and Matt Leifer.\u00a0 The inaugural TCS+ lecture will be on Wednesday Feb. 6, at noon Eastern Standard Time.\u00a0 Ronald de [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"advanced_seo_description":"","jetpack_seo_html_title":"","jetpack_seo_noindex":false,"jetpack_seo_schema_type":"","_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"{title}\n\n{excerpt}\n\n{url}","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"_wpas_customize_per_network":false,"jetpack_post_was_ever_published":false},"categories":[31,5],"tags":[],"class_list":["post-1251","post","type-post","status-publish","format-standard","hentry","category-announcements","category-complexity"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts\/1251","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1251"}],"version-history":[{"count":2,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts\/1251\/revisions"}],"predecessor-version":[{"id":3025,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=\/wp\/v2\/posts\/1251\/revisions\/3025"}],"wp:attachment":[{"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1251"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1251"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/scottaaronson.blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1251"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}