Main Page: Difference between revisions
Jump to navigation
Jump to search
imported>TCSseminar |
imported>TCSseminar No edit summary |
||
| Line 6: | Line 6: | ||
*[[计算理论之美 (Summer 2021) |计算理论之美 (Summer 2021)]] | *[[计算理论之美 (Summer 2021) |计算理论之美 (Summer 2021)]] | ||
*[[量子计算 (Spring | *[[量子计算 (Spring 2022)|量子计算 Quantum Computation (Spring 2022)]] | ||
*[[计算复杂性 (Fall 2019)|计算复杂性 Computational Complexity (Fall 2019)]] | *[[计算复杂性 (Fall 2019)|计算复杂性 Computational Complexity (Fall 2019)]] | ||
| Line 25: | Line 25: | ||
* Computational Complexity: [[计算复杂性 (Fall 2018)|Fall 2018]]. | * Computational Complexity: [[计算复杂性 (Fall 2018)|Fall 2018]]. | ||
* Quantum Computation: [[量子计算 (Fall 2019)|Fall 2019]]. | * Quantum Computation: [[量子计算 (Fall 2019)|Fall 2019]], [[量子计算 (Spring 2021)|Spring 2021]]. | ||
;Past seminars | ;Past seminars | ||
Revision as of 05:29, 14 February 2022
This is a course/seminar wiki run by the theory group in the Department of Computer Science and Technology at Nanjing University.
Home Pages for Courses and Seminars
- Past courses
- Combinatorics: Fall 2019, Fall 2017, Fall 2016, Fall 2015, Spring 2014, Spring 2013, Fall 2011, Fall 2010.
- Randomized Algorithms: Fall 2015, Spring 2014, Spring 2013, Fall 2011, Spring 2010.
- Computational Complexity: Fall 2018.
- Quantum Computation: Fall 2019, Spring 2021.
- Past seminars
- 量子算法与物理实现研讨会
- 2019 Nanjing Theory Day
- 2018 Nanjing Theory Day
- 2017 Nanjing Theory Day
- Δ Seminar on Logic, Philosophy, and Computer Science
- 近似算法 Approximation Algorithms, Fall 2011.
- 上海交大致远学院课程
- 其它链接