This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 6.896 Sublinear Time Algorithms April 19, 2007 Lecture 20 Lecturer: Ronitt Rubinfeld Scribe: Erdong Chen 1 Graph Isomorphism = We talked about a lower bound last time. Recall from last lecture (all are based on adjacent matrix model): Thm H known H unknown 1sided error ( n ) ( n 3 2 ) 2sided error ( n ) ( n ) , O ( n 5 4 ) Difference between the case that H is known and H is unknown: when H is known, query complexity to H is zero. We will discuss two upper bounds in todays class. 1.1 1Sided Tester In this subsection, we will discuss the upper bound of 1sided testers when H is known. Lemma 1 When H is known, there is a 1sided tester with ( n ) queries. Proof Algorithm: 1 Q pick each edge slot with probablity ln n n i.i.d. (no queries yet!) 2 if  Q  10 n ln n , ACCEPT, else ask queries in Q of G . 3 if there is a isomorphism from G to H consistent with Q , ACCEPT runtime: O ( n ! n ln n ) (because n ! different permutations exist) query complexity:...
View
Full
Document
This note was uploaded on 04/02/2010 for the course CS 6.896 taught by Professor Ronittrubinfeld during the Fall '04 term at MIT.
 Fall '04
 RonittRubinfeld
 Algorithms

Click to edit the document details