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!
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