l03 - 6.896 Sublinear Time Algorithms February 13, 2007...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
6.896 Sublinear Time Algorithms February 13, 2007 Lecture 3 Lecturer: Ronitt Rubinfeld Scribe: Jeremy Hurwitz In this lecture, we will prove the correctness of the equality tester for L 1 . L 1 -Dist-Test ( p, q, ± ) m O (max( ± 2 , 4) n 2 3 log n ) S p m samples from p S q m samples from q S S p S q discard any element that appears less than (1 ± 63 ) mn 2 3 times in S if S 6 = ˆ p i number of times i appears in S p ˆ q i number of times i appears in S q fail if X i S | ˆ p i ˆ q i | > ±m 8 de±ne p 0 as output of following process sample x p if x/ S output x else output x U D de±ne q 0 similarly else p 0 p , q 0 q run T ( p 0 ,q 0 , ± 2 n )w ith O ( n 2 3 ± 4 )samp les T is a tester described in the last lecture which passes p, q for which the L 2 distance is at most ±/ 2 and fails p, q for which the L 2 distance is at least ±
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the 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.

Page1 / 3

l03 - 6.896 Sublinear Time Algorithms February 13, 2007...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online