'Largest term' presentation slideshows

Discrete Math and Its Application to Computer Science

3.25k views • 101 slides

CSE 417: Algorithms and Computational Complexity

CSE 417: Algorithms and Computational Complexity. Winter 2001 Instructor: Paul Beame TA: Gidon Shavit. Working with O- W - Q notation. Claim: For any a, b>1 log a n is Q (log b n) log a n=log a b log b n so letting c=log a b we get that clog b n ?log a n ?clog b n

268 views • 11 slides