Search results
Jump to navigation
Jump to search
- === Ramsey number === ...ath> satisfying the condition in the Ramsey theory is called the '''Ramsey number'''. ...16 KB (2,818 words) - 07:52, 21 May 2014
- === Ramsey number === ...ath> satisfying the condition in the Ramsey theory is called the '''Ramsey number'''. ...16 KB (2,818 words) - 11:41, 10 December 2017
- === Ramsey number === ...ath> satisfying the condition in the Ramsey theory is called the '''Ramsey number'''. ...16 KB (2,818 words) - 12:03, 15 December 2015
- === Ramsey number === ...ath> satisfying the condition in the Ramsey theory is called the '''Ramsey number'''. ...16 KB (2,818 words) - 05:42, 11 December 2019
- === Ramsey number === ...ath> satisfying the condition in the Ramsey theory is called the '''Ramsey number'''. ...16 KB (2,818 words) - 01:52, 4 December 2016
- === Ramsey number === ...ath> satisfying the condition in the Ramsey theory is called the '''Ramsey number'''. ...17 KB (3,025 words) - 11:53, 21 November 2011
- |align="center"| 14:15-15:00 ...cations, we obtain fully polynomial-time approximate schemes (FPRAS) for a number of counting problems, including the generalization of matchings and edges c ...5 KB (714 words) - 04:34, 17 January 2018
- === Ramsey number === ...ath> satisfying the condition in the Ramsey theory is called the '''Ramsey number'''. ...23 KB (4,275 words) - 12:28, 1 December 2010
- ...13/random13.pdf 13]| [http://tcs.nju.edu.cn/slides/random2013/random14.pdf 14]| [http://tcs.nju.edu.cn/slides/random2013/random15.pdf 15]| [http://tcs.nj ...of Measure]]: martingales, Azuma's inequality, Doob martingales, chromatic number of random graphs ...10 KB (1,029 words) - 12:44, 15 September 2017
- ...m edge weight. When the underlying graph is super dense, namely, the total number of insertions <math>m</math> is <math>\tilde{\Omega}(n^2)</math>, their upp |align="center"|14：00 -- 14:30 ...16 KB (900 words) - 04:52, 13 November 2020
- ...m edge weight. When the underlying graph is super dense, namely, the total number of insertions <math>m</math> is <math>\tilde{\Omega}(n^2)</math>, their upp |align="center"|14：00 -- 14:30 ...16 KB (900 words) - 04:54, 13 November 2020
- === Ramsey number === ...ath> satisfying the condition in the Ramsey theory is called the '''Ramsey number'''. ...25 KB (4,530 words) - 12:14, 26 May 2023
- ...h>(1+x)^3=1+3x+3x^2+x^3</math>. The coefficient of <math>x^k</math> is the number of <math>k</math>-subsets of a 3-element set. In general, <math>(1+x)^n</math> has the coefficients which are the number of subsets of fixed sizes of an <math>n</math>-element set. ...20 KB (3,444 words) - 04:53, 7 October 2010
- ...A user of RSA creates and then publishes the product of two large [[prime number]]s, along with an auxiliary value, as their public key. The prime factors m # Choose two different large random [[prime number]]s <math>p \,</math> and <math>q \,</math> ...14 KB (2,168 words) - 11:19, 5 August 2017
- ...m edge weight. When the underlying graph is super dense, namely, the total number of insertions <math>m</math> is <math>\tilde{\Omega}(n^2)</math>, their upp |align="center"|14：00 -- 14:30 ...20 KB (1,328 words) - 14:52, 20 November 2020
- : (ESU CGS) 1 statA·cm² = 3.33564095×10<sup>-14</sup> ([[Metre|m]]<sup>2</sup>·[[Ampere|A]] or N.m/[[Tesla (unit)|T]]) ...sup> [[Joule (unit)|J]]/[[Tesla (unit)|T]])!![[spin (physics)|Spin quantum number]] ([[dimensionless]]) ...9 KB (1,446 words) - 17:48, 24 July 2017
- ...h>(1+x)^3=1+3x+3x^2+x^3</math>. The coefficient of <math>x^k</math> is the number of <math>k</math>-subsets of a 3-element set. In general, <math>(1+x)^n</math> has the coefficients which are the number of subsets of fixed sizes of an <math>n</math>-element set. ...24 KB (4,338 words) - 12:04, 14 September 2015
- ...h>(1+x)^3=1+3x+3x^2+x^3</math>. The coefficient of <math>x^k</math> is the number of <math>k</math>-subsets of a 3-element set. In general, <math>(1+x)^n</math> has the coefficients which are the number of subsets of fixed sizes of an <math>n</math>-element set. ...24 KB (4,338 words) - 13:15, 6 September 2019
- ...h>(1+x)^3=1+3x+3x^2+x^3</math>. The coefficient of <math>x^k</math> is the number of <math>k</math>-subsets of a 3-element set. In general, <math>(1+x)^n</math> has the coefficients which are the number of subsets of fixed sizes of an <math>n</math>-element set. ...24 KB (4,338 words) - 12:57, 11 September 2016
- ...h>(1+x)^3=1+3x+3x^2+x^3</math>. The coefficient of <math>x^k</math> is the number of <math>k</math>-subsets of a 3-element set. In general, <math>(1+x)^n</math> has the coefficients which are the number of subsets of fixed sizes of an <math>n</math>-element set. ...24 KB (4,338 words) - 09:04, 12 September 2017