204211-src-51-1 - ประวัติรุ่นแก้ไข

158.108.127.50: /* 14 ก.ย. 51 */

2008-09-14T05:04:23Z

14 ก.ย. 51

2008-09-13T09:51:37Z

14 ก.ย. 51

2008-09-13T09:43:01Z

Actual

2008-09-13T09:41:59Z

Planed

2008-09-06T16:37:27Z

Planed

2008-09-06T16:25:19Z

2008-08-31T04:21:10Z

31 ส.ค. 51

2008-08-31T03:38:38Z

31 ส.ค. 51

2008-08-31T03:37:44Z

31 ส.ค. 51

2008-08-31T03:36:06Z

31 ส.ค. 51

@@ แถว 82: / แถว 82: @@
 ====เช้า====
 * polynomials and codes
-** polynomials, polynomial interpolation
+** polynomials: two properties:
 ** finite fields
 ** secret sharing
 ** erasure codes
 * stable matching

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 09:51, 13 กันยายน 2551
แถว 80:		แถว 80:

	===14 ก.ย. 51===		===14 ก.ย. 51===
		+	====เช้า====
		+	* polynomials and codes
		+	** polynomials, polynomial interpolation
		+	** finite fields
		+	** secret sharing
		+	** erasure codes
		+	* intro to graph theory
		+	====บ่าย====
		+	* stable matching

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 09:43, 13 กันยายน 2551
แถว 78:		แถว 78:
	** Recursive definition and counting		** Recursive definition and counting
	** Recursive algorithms, divide and conquer		** Recursive algorithms, divide and conquer
		+
		+	===14 ก.ย. 51===

@@ แถว 28: / แถว 28: @@
 ** modular arithematics
 ** Fermat's Little Theorem
-** polynomials #
+** polynomials
-** secret sharing, coding #
+** secret sharing, erasure codes
 ** RSA
 * Stable marriage
-* Graph theory
+* Intro to Graph theory
 $ --- absence, to be covered
 ==Actual==

@@ แถว 31: / แถว 31: @@
 ** secret sharing, coding #
 ** RSA
 $ --- absence, to be covered
 # --- skipped
 ==Actual==
 ===10 ส.ค. 51===

@@ แถว 18: / แถว 18: @@
 *** strong induction
 *** examples used: tiling, placing dominoes, induction on matrices, Fibonacci numbers
-*** recursive thinking $
+*** recursive thinking
-** Pigeon-Hole Principle $
+** Pigeon-Hole Principle
 ** diagonalization
@@ แถว 28: / แถว 28: @@
 ** modular arithematics
 ** Fermat's Little Theorem
-** polynomials $
+** polynomials #
-** secret sharing, coding $
+** secret sharing, coding #
-** RSA $
+** RSA
 $ --- absence, to be covered
+# --- skipped
 ==Actual==
 ===10 ส.ค. 51===

@@ แถว 68: / แถว 68: @@
 **** Success probability of the test and [http://en.wikipedia.org/wiki/Carmichael_number Carmicheal number]
 *** Proof of Fermat's Little Theorem
-** Proof of Euler Theorem and RSA
+** Euler Theorem and RSA
 * Recursions
 ** Recursive definition and counting
 ** Recursive algorithms, divide and conquer

@@ แถว 59: / แถว 59: @@
 ===31 ส.ค. 51===
 * Number Theory
 ** Primality testing
 *** Testing in exponential time ($O(p)$ and $O(\sqrt{p})$ for testing $p$)

@@ แถว 61: / แถว 61: @@
 ** Primality testing
 *** Testing in exponential time ($O(p)$ and $O(\sqrt{p})$ for testing $p$)
 *** Testing based on Fermat's Little Theorem
 **** Implementation of the test: Repeated squaring