New pages

Jump to navigation Jump to search
New pages
Hide registered users | Show bots | Hide redirects

17 March 2026

  • 09:4109:41, 17 March 2026 概率论与数理统计 (Spring 2026)/Entropy and volume of Hamming balls (hist | edit) [3,052 bytes] Etone (talk | contribs) (Created page with "在求解抛掷公平硬币(fair coin)的尾概率时,我们经常会需要分析如下二项式系数求和: :<math>\sum_{k=0}^r{n\choose k}</math>,对于某个<math>1\le r\le n</math> 这其实等价与求一个 <math>n</math> 维汉明空间中半径为 <math>r</math> 的球的体积。 :{|border="2" width="100%" cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show;" | :'...")
  • 07:4707:47, 17 March 2026 概率论与数理统计 (Spring 2026)/Problem Set 1 (hist | edit) [10,439 bytes] Yqzhu (talk | contribs) (Created page with "*每道题目的解答都要有完整的解题过程,中英文不限。 *我们推荐大家使用LaTeX, markdown等对作业进行排版。 == Assumption throughout Problem Set 1== <p>Without further notice, we are working on probability space <math>(\Omega,\mathcal{F},\mathbf{Pr})</math>.</p> <h2 id="problem-2-principle-of-inclusion-and-exclusion">Problem 1 (Principle of Inclusion and Exclusion, 8 points)</h2> <p>Let <math>n\ge 1</math> be a positive integer and <m...")

11 March 2026

  • 08:3808:38, 11 March 2026 组合数学 (Spring 2026)/Generating functions (hist | edit) [25,549 bytes] Etone (talk | contribs) (Created page with "== Generating Functions == In Stanley's magnificent book ''Enumerative Combinatorics'', he comments the generating function as "the most useful but most difficult to understand method (for counting)". The solution to a counting problem is usually represented as some <math>a_n</math> depending a parameter <math>n</math>. Sometimes this <math>a_n</math> is called a ''counting function'' as it is a function of the parameter <math>n</math>. <math>a_n</math> can also be tre...")

3 March 2026

  • 16:2516:25, 3 March 2026 高级算法 (Spring 2026)/作业1 (hist | edit) [1,291 bytes] Liumingmou (talk | contribs) (Created page with "*每道题目的解答都要有完整的解题过程,中英文不限。 *我们推荐大家使用LaTeX, markdown等对作业进行排版。 *没有条件的同学可以用纸笔完成作业之后拍照。 # Karp-Rabin Algorithm 使用一个 equality testing 算法作为黑盒子以达成 <math>O(m+n)</math> 的时间复杂度。分别讨论用本门课中介绍的其他 equality testing 算法替代 Karp-Rabin Algorithm 的 equality testing 算法能否达成 <math>O(...")
  • 08:5808:58, 3 March 2026 组合数学 (Spring 2026)/Basic enumeration (hist | edit) [39,712 bytes] Etone (talk | contribs) (Created page with "== Basic Enumeration == The three basic rules for enumeration are: *'''The sum rule''': for any '''''disjoint''''' finite sets <math>S</math> and <math>T</math>, the cardinality of the union <math>|S\cup T|=|S|+|T|</math>. *'''The product rule''': for any finite sets <math>S</math> and <math>T</math>, the cardinality of the Cartesian product <math>|S\times T|=|S|\cdot|T|</math>. *'''The bijection rule''': if there exists a bijection between finite sets <math>S</math> a...")
  • 08:5608:56, 3 March 2026 组合数学 (Spring 2026) (hist | edit) [10,552 bytes] Etone (talk | contribs) (Created page with "{{Infobox |name = Infobox |bodystyle = |title = <font size=3>组合数学 <br> Combinatorics</font> |titlestyle = |image = |imagestyle = |caption = |captionstyle = |headerstyle = background:#ccf; |labelstyle = background:#ddf; |datastyle = |header1 =Instructor |label1 = |data1 = |header2 = |label2 = |data2 = 尹一通 |header3 = |label3 = Email |data3 = yinyt@nju.edu.cn |header4 = |label4= office |data4=...")

28 February 2026

23 February 2026

  • 17:0517:05, 23 February 2026 高级算法 (Spring 2026) (hist | edit) [7,247 bytes] Liumingmou (talk | contribs) (Created page with "{{Infobox |name = Infobox |bodystyle = |title = <font size=3>高级算法 <br>Advanced Algorithms</font> |titlestyle = |image = |imagestyle = |caption = |captionstyle = |headerstyle = background:#ccf; |labelstyle = background:#ddf; |datastyle = |header1 =任课教师 |label1 = |data1 = |header2 = |label2 = |data2 = '''刘明谋''' |header3 = |label3 = 电子邮件 |data3 = lmm@nju.edu.cn |header4 = |label4=...")

16 January 2026

  • 09:4309:43, 16 January 2026 高级算法 (Fall 2025)/第三次作业提交名单 (hist | edit) [1,694 bytes] Zhangyiyao (talk | contribs) (Created page with "如有错漏请邮件联系助教. <center> {| class="wikitable" |- ! 学号 !! 姓名 |- | 221502007 || 崔毓泽 |- | 221502008 || 梁今为 |- | 221502013 || 贺龄瑞 |- | 221850037 || 王朝晖 |- | 221900156 || 韩加瑞 |- | 231098067 || 徐浩然 |- | 231220002 || 潘谟天 |- | 231220005 || 樊书岩 |- | 231220007 || 汪文韬 |- | 231220012 || 张启越 |- | 231220019 || 何云天 |- | 231220056 || 黄思远 |- | 231220179 || 徐钰炜 |- | 231240...") Tag: Visual edit: Switched

25 December 2025

  • 14:2514:25, 25 December 2025 高级算法 (Fall 2025)/Problem Set 3 (hist | edit) [0 bytes] Zhangyiyao (talk | contribs) (Created page with "*每道题目的解答都要有完整的解题过程,中英文不限。 *我们推荐大家使用LaTeX, markdown等对作业进行排版。 == Problem 1 == Let <math>\mathcal{M} = (E, \mathcal{I})</math> be a matroid with rank function <math>r_{\mathcal{M}} : 2^E \to \mathbb{Z}_{\ge 0}</math>. Prove that <math>r_{\mathcal{M}}</math> is submodular. == Problem 2 == In class, you learned two greedy algorithms with the same framework: * For maximizing a non-negative add...")