First Hangout with Ronald de Wolf will speak on “Exponential Lower Bounds for Polytopes in Combinatorial Optimization” Sounds highly interesting. Perhaps we would see more ‘+’ of other fields as well!

MyCQstate

You heard it here first — a new series of online seminars! For those of you who know, we got inspiration from the great Q+ seminars run by Daniel Burgarth and Matt Leifer.

Without further ado, here is the announcement:

——————————

Dear fellow TCSers,

Ever wished you could attend that talk — if only you didn’t have to hike the Rockies, or swim across the Atlantic, to get there; if only it could have been scheduled the following week, because this week is finals; if only you could watch it from your desk, or for that matter directly from your bed?

Starting this semester TCS+ will solve all your worries. We are delighted to announce the initiation of a new series of *online* seminars in theoretical computer science. The seminars will be run using the “hangout” feature of Google+. The speaker and slides will be broadcast live as well as…

View original post 502 more words

Advertisements

Published by

Sankalp Ghatpande

Student of MS Information and Computer Science. Interested in Research @ Information Security | Cryptology | Quantum information science.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s