User contributions for Gispzjz
Jump to navigation
Jump to search
8 June 2023
- 14:2114:21, 8 June 2023 diff hist +1 组合数学 (Fall 2023)/Problem Set 4 →Problem 1
- 14:2114:21, 8 June 2023 diff hist +1 组合数学 (Fall 2023)/Problem Set 4 →Problem 5
- 14:2014:20, 8 June 2023 diff hist +4 组合数学 (Fall 2023)/Problem Set 4 →Problem 5
- 14:2014:20, 8 June 2023 diff hist +517 组合数学 (Fall 2023)/Problem Set 4 →Problem 5
- 14:1714:17, 8 June 2023 diff hist +102 组合数学 (Fall 2023)/Problem Set 4 →Problem 5
- 14:1514:15, 8 June 2023 diff hist +1,759 N 组合数学 (Fall 2023)/Problem Set 4 Created page with "== Problem 1 == Prove that * <math>R(4,3)\leq 9</math>. (Hint: Proof by contradiction. Color the edges of <math>K_9</math> in red and blue, and assume that there are no red triangles and no blue <math>4</math>-cliques. Try to determine the number of red and blue edges adjacent to each vertex) * <math>R(4,4)\leq 18</math>. ==Problem 2== We color each non-empty subset of <math>[n]=\{1,2,\ldots,n\}</math> with one of the <math>r</math> colors in <math>[r]</math>. Show tha..."
- 13:2813:28, 8 June 2023 diff hist 0 组合数学 (Spring 2023) →Assignments
- 13:2713:27, 8 June 2023 diff hist +59 组合数学 (Spring 2023) →Assignments
13 April 2023
- 13:2313:23, 13 April 2023 diff hist −2 组合数学 (Fall 2023)/Problem Set 2 →Problem 5
- 13:2213:22, 13 April 2023 diff hist +1 组合数学 (Fall 2023)/Problem Set 2 →Problem 5
- 13:2113:21, 13 April 2023 diff hist +495 组合数学 (Fall 2023)/Problem Set 2 →Problem 4
- 13:0813:08, 13 April 2023 diff hist +216 组合数学 (Fall 2023)/Problem Set 2 →Problem 1
- 13:0813:08, 13 April 2023 diff hist +889 组合数学 (Fall 2023)/Problem Set 2 →Problem 2
- 13:0813:08, 13 April 2023 diff hist −888 组合数学 (Fall 2023)/Problem Set 2 →Problem 1
- 13:0813:08, 13 April 2023 diff hist −216 组合数学 (Fall 2023)/Problem Set 2 →Problem 2
- 13:0813:08, 13 April 2023 diff hist +276 组合数学 (Fall 2023)/Problem Set 2 →Problem 1
- 13:0513:05, 13 April 2023 diff hist +611 组合数学 (Fall 2023)/Problem Set 2 →Problem 1
- 12:5412:54, 13 April 2023 diff hist +1 组合数学 (Fall 2023)/Problem Set 2 →Problem 3
- 12:5312:53, 13 April 2023 diff hist −11 组合数学 (Fall 2023)/Problem Set 2 →Problem 4
- 12:5312:53, 13 April 2023 diff hist +430 组合数学 (Fall 2023)/Problem Set 2 →Problem 3
- 12:5212:52, 13 April 2023 diff hist +2 组合数学 (Fall 2023)/Problem Set 2 →Problem 3
- 12:5212:52, 13 April 2023 diff hist +51 组合数学 (Fall 2023)/Problem Set 2 →Problem 2
- 12:5012:50, 13 April 2023 diff hist +165 组合数学 (Fall 2023)/Problem Set 2 →Problem 2
- 12:4712:47, 13 April 2023 diff hist +35 组合数学 (Fall 2023)/Problem Set 2 →Problem 1
- 12:4712:47, 13 April 2023 diff hist +17 组合数学 (Fall 2023)/Problem Set 2 No edit summary
- 12:4612:46, 13 April 2023 diff hist +728 N 组合数学 (Fall 2023)/Problem Set 2 Created page with "Let <math>S=\{P_1,...,P_n\}</math> be a set of properties, and let <math>f_k</math> (respectively, <math>f_{\geq k}</math>) denote the number of objects in a finite set <math>U</math> that have '''exactly''' <math>k</math> (respectively, '''at least''' <math>k</math>) of the properties. Let <math>A_i</math> denote the set of objects satisfies <math>P_i</math> in <math>U</math>, for any <math>I\subseteq\{1,...,n\}</math>, we denote <math>A_I=\bigcap_{i\in I}A_i</math> wi..."
- 12:1412:14, 13 April 2023 diff hist +157 组合数学 (Spring 2023) →Assignments
13 February 2023
12 December 2022
- 07:5107:51, 12 December 2022 diff hist −1 高级算法 (Fall 2022)/Problem Set 4 →Problem 7
- 07:5107:51, 12 December 2022 diff hist +7 高级算法 (Fall 2022)/Problem Set 4 →Problem 7
- 07:5007:50, 12 December 2022 diff hist −1 高级算法 (Fall 2022)/Problem Set 4 →Problem 7
- 07:5007:50, 12 December 2022 diff hist +692 高级算法 (Fall 2022)/Problem Set 4 →Problem 7
- 07:4607:46, 12 December 2022 diff hist −1 高级算法 (Fall 2022)/Problem Set 4 →Problem 7
- 07:4507:45, 12 December 2022 diff hist +585 高级算法 (Fall 2022)/Problem Set 4 →Problem 6
- 07:3707:37, 12 December 2022 diff hist +2,984 高级算法 (Fall 2022)/Problem Set 4 →Problem 3
- 07:3507:35, 12 December 2022 diff hist +5 高级算法 (Fall 2022)/Problem Set 4 →Problem 3
- 07:3407:34, 12 December 2022 diff hist +5 高级算法 (Fall 2022)/Problem Set 4 →Problem 3
- 07:3407:34, 12 December 2022 diff hist +413 高级算法 (Fall 2022)/Problem Set 4 →Problem 2
- 07:3407:34, 12 December 2022 diff hist −334 高级算法 (Fall 2022)/Problem Set 4 →Problem 3 Tag: Manual revert
- 07:3307:33, 12 December 2022 diff hist +334 高级算法 (Fall 2022)/Problem Set 4 →Problem 2
- 07:3007:30, 12 December 2022 diff hist +1,717 高级算法 (Fall 2022)/Problem Set 4 →Problem 1
- 07:2907:29, 12 December 2022 diff hist +656 N 高级算法 (Fall 2022)/Problem Set 4 Created page with "== Problem 1 == Suppose there is a coin <math> C </math>. During each query, it outputs HEAD with probability <math>p</math> and TAIL with probability <math>1-p</math>, where <math> p \in (0, 1) </math> is a real number. * Let <math> q \in (0, 1) </math> be another real number. Design an algorithm that outputs HEAD with probability <math>q</math> and TAIL with probability <math>1-q</math>. There is no other random sources for your algorithm except the coin <math>C</math..."
- 07:2707:27, 12 December 2022 diff hist +57 高级算法 (Fall 2022) →Assignments
9 October 2022
- 08:4108:41, 9 October 2022 diff hist +5,213 高级算法 (Fall 2022)/Problem Set 1 →Problem 2
- 08:4008:40, 9 October 2022 diff hist +1,486 高级算法 (Fall 2022)/Problem Set 1 →Problem 1
- 08:3908:39, 9 October 2022 diff hist +560 N 高级算法 (Fall 2022)/Problem Set 1 Created page with "== Problem 1 == Modify the Karger's Contraction algorithm so that it works for the ''weighted min-cut problem''. Prove that the modified algorithm returns a weighted minimum cut with probability at least <math>\frac{2}{n(n-1)}</math>. The weighted min-cut problem is defined as follows. *'''Input''': an undirected weighted graph <math>G(V, E)</math>, where every edge <math>e \in E</math> is associated with a positive real weight <math>w_e</math>; *'''Output''': a cut <ma..."
- 08:3908:39, 9 October 2022 diff hist +58 高级算法 (Fall 2022) →Assignments
5 September 2022
- 13:5913:59, 5 September 2022 diff hist +25 高级算法 (Fall 2020) / Course materials →References and further readings current
- 13:5713:57, 5 September 2022 diff hist +1 N File:DPV.jpg No edit summary current
- 13:5513:55, 5 September 2022 diff hist −15 高级算法 (Fall 2020) / Course materials →References and further readings
