%PDF-1.5 % 1 0 obj << /S /GoTo /D (section.1) >> endobj 4 0 obj (Useful concentration inequalities) endobj 5 0 obj << /S /GoTo /D (section.2) >> endobj 8 0 obj (Proof of the Correctness of the QE Algorithm \(Lemma 4.1\)) endobj 9 0 obj << /S /GoTo /D (section.3) >> endobj 12 0 obj (Proof of the Correctness of the AR Algorithm \(Lemma 4.2 in the Main Text\)) endobj 13 0 obj << /S /GoTo /D (section.4) >> endobj 16 0 obj (Proof of the Main Complexity Result \(Theorem 4.3 in the Main Text\)) endobj 17 0 obj << /S /GoTo /D (section.5) >> endobj 20 0 obj (Proof of the Complexity Result for K n/2 \(Theorem 4.5 in the Main Text\)) endobj 21 0 obj << /S /GoTo /D (section.6) >> endobj 24 0 obj (An Alternative to the AR Procedure \(Remark Remark 4.1 in the Main Text\)) endobj 25 0 obj << /S /GoTo /D (section.7) >> endobj 28 0 obj (Naive Uniform Sampling \(Remark Remark 4.2 in the Main Text\)) endobj 29 0 obj << /S /GoTo /D (section.8) >> endobj 32 0 obj (Lower bounds) endobj 33 0 obj << /S /GoTo /D (subsection.8.1) >> endobj 36 0 obj (Proof of the First Lower Bound \(Lemma 5.2 in the Main Text\) ) endobj 37 0 obj << /S /GoTo /D (subsection.8.2) >> endobj 40 0 obj (Proof of the Second Lower Bound \(Lemma 5.4 and Theorem 5.5 in the Main Text\)) endobj 41 0 obj << /S /GoTo /D (section.9) >> endobj 44 0 obj (Additional Experiments) endobj 45 0 obj << /S /GoTo /D [46 0 R /FitH] >> endobj 50 0 obj << /Length 2926 /Filter /FlateDecode >> stream x[[s~ׯش/4~ql4IN3cV[,"Kv;] 8wn-ײ`pdq~UpVZAUq~Y^^]=@L!5YB1DX~%.6˒+xWoUnuXh~[mևuoj(q1NA$VXZ`bR_Cp]gWfS/ZܯûKnà*H^v E\]62^wv:.kz:_o6E3ݾjjJ]3Ata۷m`}4f0L;NA%ޯ`خc^yJ*i90G8B]-(-Y x*ʚ)nE;evaPQ -]IjVhXeF0 8ozMOׇ0js>]gYmg}MsDZ&'Oqmnwvb1\ 4lZ4S)`qZA(w~P hS(-9{ {?P pStc'Q=e",(+2Fl̙ \ :ZGΉ=Br5~.m\Ɩ;e!`X"'etYcL!fQz,lay_V;Y> } Hb$1bΰTG3=3J!'h g[b<'''fh&bͷCHm'{1cpR߾iHg &k. Je a BWy9ƙC& 6.tyOd:`ɮd>IAH= >^DRUv"DŽDRP# @ZsV*(x\ (¸P i!g 2 ӄUH9 r<. ;@=)˰XO!j"CHa}<]SHg%ER OL,H ;lmX>}ߘ26JgX2bm ֵ',Ϙ̓p14:btDHs#Ba0