User contributions for Gispzjz

12 December 2022

• 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