This preview shows page 1. Sign up to view the full content.
Unformatted text preview: T A of A should be sT B + O ( skT G ) where T B is the running time of B and T G is the time to do a group operation. 1. [25 points] Consider the following algorithm A : algorithm A ( X ) 01 for i = 1 ,... ,s do 02 y i $ ← B ( X ) 03 if g y i = X then return y i 04 return ⊥ Explain why A does not necessarily improve B . Give an example of B such that Adv dl G,g ( A ) ≤ 1 / 2. 2. [25 points] Provide an algorithm A that does improve B as desired. 1...
View
Full
Document
This note was uploaded on 08/31/2011 for the course CSE 207 taught by Professor Daniele during the Winter '08 term at UCSD.
 Winter '08
 daniele
 Computer Science

Click to edit the document details