Send any comments, suggestions, remarks regarding this web-page to papakons@cs.toronto.edu.
Last updated: October 20, 2007
This web-page complies to a little bit older fashion
(trends) in Theoretical Computer Science
This is a reading group type of seminar mainly focused in modern techniques in Computational Complexity. Occasionally we review classical complexity theoretic results. We include topics from (but not limited to) Combinatorial and Algebraic Complexity, Structural Complexity and connections of Complexity and Logic. We work in an orthogonal direction to the Theory Student Seminar (TSS) running (quite successfully) in the department for many years. In contrast to TSS this seminar is much more focused and mainly works in a more tutorial-oriented fashion. We do not merely present a number of (significant) results but also we aim to provide in-depth coverage of subjects that interest participants. We try to keep the seminar structured in a mini-course fashion (consecutive, semantically related topics). Unlike regular seminars, when necessary a topic is accompanied with prerequisites presentation(s).
The seminar takes place once in every one or two weeks (or so) on Tuesday at 10.30 (10.30-11.10, 10 min break, 11.20-12.00), at the Theory Lab
|
|
| Date | Topic | Presented by | |
|---|---|---|---|
| Oct 23 and Nov 6, 2007 | Non Interactive Zero Knowledge (NIZK) | Yevgeniy | |
| Oct 1 and 9, 2007 | Interactive proofs, Zero knowledge and Complexity classes | Periklis | |
| Sep 24, 2007 | Head-start: Graph non-Isomorphism | Yevgeniy | |
| Apr 13 to Sep 7, 2005 | Session on Expanders |
The schedule above the purple bar (ahead in time from the current
presentation) is tentative.
If you want to be added to or removed from the e-mailing list of the seminar send an email to compseminar-request@cs.toronto.edu with your subscribe/removal request.
Send any comments, suggestions, remarks regarding this web-page to
papakons@cs.toronto.edu.
Last updated: October 20, 2007