User contributions for Etone

12 March 2023

• 02:4002:40, 12 March 2023 diff hist −5 概率论与数理统计 (Spring 2023)/Polynomial identity testing No edit summary
• 02:4002:40, 12 March 2023 diff hist +13 概率论与数理统计 (Spring 2023)/Polynomial identity testing No edit summary
• 02:4002:40, 12 March 2023 diff hist +21 概率论与数理统计 (Spring 2023)/Polynomial identity testing No edit summary
• 02:3902:39, 12 March 2023 diff hist +84 概率论与数理统计 (Spring 2023)/Polynomial identity testing No edit summary
• 02:3602:36, 12 March 2023 diff hist −27 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm No edit summary current
• 02:3302:33, 12 March 2023 diff hist −45 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm No edit summary

11 March 2023

• 17:5217:52, 11 March 2023 diff hist 0 概率论与数理统计 (Spring 2023) →Lectures
• 17:5117:51, 11 March 2023 diff hist +23 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Analysis of Karger's Algorithm
• 17:4917:49, 11 March 2023 diff hist 0 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →A Consequence of the Probabilistic Method
• 17:4917:49, 11 March 2023 diff hist +2 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →A Corollary by the Probabilistic Method
• 17:4817:48, 11 March 2023 diff hist −282 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Analysis of Karger's Algorithm
• 17:4617:46, 11 March 2023 diff hist −913 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Analysis of Karger's Algorithm
• 17:4617:46, 11 March 2023 diff hist −25 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Analysis of Karger's Algorithm
• 17:4517:45, 11 March 2023 diff hist −10 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Analysis of Karger's Algorithm
• 17:4417:44, 11 March 2023 diff hist −20 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Analysis of accuracy
• 17:4117:41, 11 March 2023 diff hist −920 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Karger's Algorithm
• 17:4117:41, 11 March 2023 diff hist +28 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Karger's Algorithm
• 17:4017:40, 11 March 2023 diff hist −34 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Karger's Algorithm
• 17:3817:38, 11 March 2023 diff hist −16 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Karger's Contraction algorithm
• 17:3817:38, 11 March 2023 diff hist −770 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm No edit summary
• 17:3717:37, 11 March 2023 diff hist −148 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm No edit summary
• 17:3717:37, 11 March 2023 diff hist −12 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Min-Cut
• 17:3617:36, 11 March 2023 diff hist −14 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Graph Cut
• 17:3617:36, 11 March 2023 diff hist −6,151 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Fast Min-Cut
• 17:3517:35, 11 March 2023 diff hist −19,453 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm →Max-Cut
• 17:3517:35, 11 March 2023 diff hist +44,285 N 概率论与数理统计 (Spring 2023)/Karger's min-cut algorithm Created page with "= Graph Cut = Let <math>G(V, E)</math> be an undirected graph. A subset <math>C\subseteq E</math> of edges is a '''cut''' of graph <math>G</math> if <math>G</math> becomes ''disconnected'' after deleting all edges in <math>C</math>. Let <math>\{S,T\}</math> be a '''bipartition''' of <math>V</math> into nonempty subsets <math>S,T\subseteq V</math>, where <math>S\cap T=\emptyset</math> and <math>S\cup T=V</math>. A cut <math>C</math> is specified by this bipartition as..."
• 17:3417:34, 11 March 2023 diff hist 0 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:3417:34, 11 March 2023 diff hist +15 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:3317:33, 11 March 2023 diff hist +8 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:3217:32, 11 March 2023 diff hist −5 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:3117:31, 11 March 2023 diff hist +75 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:2517:25, 11 March 2023 diff hist −2 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:2217:22, 11 March 2023 diff hist −4 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:2117:21, 11 March 2023 diff hist −15 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:2017:20, 11 March 2023 diff hist −4 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:1917:19, 11 March 2023 diff hist +53 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:1717:17, 11 March 2023 diff hist −92 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:1417:14, 11 March 2023 diff hist +11 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:1317:13, 11 March 2023 diff hist +111 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Lemma
• 17:1217:12, 11 March 2023 diff hist −2,355 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Schwartz-Zippel Theorem
• 17:1017:10, 11 March 2023 diff hist +60 概率论与数理统计 (Spring 2023)/Polynomial identity testing No edit summary
• 17:0717:07, 11 March 2023 diff hist −18 概率论与数理统计 (Spring 2023)/Polynomial identity testing No edit summary
• 17:0717:07, 11 March 2023 diff hist +928 概率论与数理统计 (Spring 2023)/Polynomial identity testing No edit summary
• 16:4416:44, 11 March 2023 diff hist −37 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Polynomial Identity Testing (PIT)
• 16:4416:44, 11 March 2023 diff hist −6,504 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Checking distinctness
• 16:4316:43, 11 March 2023 diff hist −7,835 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Fingerprinting
• 16:4316:43, 11 March 2023 diff hist −4,197 概率论与数理统计 (Spring 2023)/Polynomial identity testing →Communication Complexity of Equality
• 16:4316:43, 11 March 2023 diff hist +30,540 N 概率论与数理统计 (Spring 2023)/Polynomial identity testing Created page with "=Polynomial Identity Testing (PIT) = The '''Polynomial Identity Testing (PIT)''' is such a problem: given as input two polynomials, determine whether they are identical. It plays a fundamental role in ''Identity Testing'' problems. First, let's consider the univariate ("one variable") case: * '''Input:''' two polynomials <math>f, g\in\mathbb{F}[x]</math> of degree <math>d</math>. * Determine whether <math>f\equiv g</math> (<math>f</math> and <math>g</math> are identica..."
• 16:4216:42, 11 March 2023 diff hist +12 概率论与数理统计 (Spring 2023) →Lectures
• 16:4216:42, 11 March 2023 diff hist +197 概率论与数理统计 (Spring 2023) →Lectures