組合數學
Combinatorial Mathematics
| 節 | 週一 |
|---|---|
A 18:30–19:20 | 組合數學 EC122 3 節連堂 |
B 19:30–20:20 | |
C 20:30–21:20 |
* 根據陽明交大上課時間表所列
To learn the concepts of combinatorics and its potential applications in computer science. As a second goal for the students from the CS department, we will introduce a few classic computation problems and their optimal algorithmic solutions. Course website: https://sites.google.com/nycu.edu.tw/113-2-combo-math
Linear Algebra, Probability, Discrete Mathematics
Students are expected to read the lecture notes & slides and do homework problems spontaneously in order to fully understand the concepts.
Approximately 5 Handwritten Homework: 20% Approximately 4 Program Assignments: 20% Two Midterm Exams and Final: 60%
- The classics
- Topics in graphs
- Advanced algorithmic topics
| 週次 | 主題 |
|---|---|
| 第 1 週 | Probabilistic method |
| 第 2 週 | The Pigeonhole principle |
| 第 3 週 | Miscellaneous topics in counting |
| 第 4 週 | The Lovasz sieve and the local lemma |
| 第 5 週 | Supplement: The Algorithmic Lovasz local lemma |
| 第 6 週 | *** Midterm (I) *** |
| 第 7 週 | Hall's matching theorem and System of distinct representatives |
| 第 8 週 | Maximum bipartite matching |
| 第 9 週 | Weighted bipartite matching The Hungarian algorithm for min-cost perfect matching |
| 第 10 週 | The max-flow min-cut theorem |
| 第 11 週 | The RMQ problem and optimal algorithms |
| 第 12 週 | *** Midterm (II) *** |
| 第 13 週 | Suffix tree, BWT transforms for strings |
| 第 14 週 | Eigenvalues and graph expansions, Expander decomposition of graphs (if time permits) |
| 第 15 週 | Expander decomposition of graphs (if time permits) Random walks in graphs |
| 第 16 週 | *** Final exam *** |
| 第 17 週 | |
| 第 18 週 |
1. Applied Combinatorics, 6th Ed, Alan Tucker 2. Extremal Combinatorics, 2nd Ed, Stasys Junka.
- 時間
- In class or by appointment via email (if necessary)