%PDF-1.4 %ÐÔÅØ 5 0 obj > endobj 8 0 obj (NP and NP completeness) endobj 9 0 obj > endobj 12 0 obj (The class NP) endobj 13 0 obj > endobj 16 0 obj (Relation between NP and P) endobj 17 0 obj > endobj 20 0 obj (Non-deterministic Turing machines.) endobj 21 0 obj > endobj 24 0 obj (Reducibility and NP-completeness) endobj 25 0 obj > endobj 28 0 obj (The Cook-Levin Theorem: Computation is Local) endobj 29 0 obj > endobj 32 0 obj (Boolean formulae and the CNF form.) endobj 33 0 obj > endobj 36 0 obj (The Cook-Levin Theorem) endobj 37 0 obj > endobj 40 0 obj (Warmup: Expressiveness of boolean formulae) endobj 41 0 obj > endobj 44 0 obj (Proof of Lemma 2.12) endobj 45 0 obj > endobj 48 0 obj (Reducing SAT to 3SAT.) endobj 49 0 obj > endobj 52 0 obj (More thoughts on the Cook-Levin theorem) endobj 53 0 obj > endobj 56 0 obj (The web of reductions) endobj 57 0 obj > endobj 60 0 obj (In praise of reductions) endobj 61 0 obj > endobj 64 0 obj (Coping with NP hardness.) endobj 65 0 obj > endobj 68 0 obj (Decision versus search) endobj 69 0 obj > endobj 72 0 obj (coNP, EXP and NEXP) endobj 73 0 obj > endobj 76 0 obj (coNP) endobj 77 0 obj > endobj 80 0 obj (EXP and NEXP) endobj 81 0 obj > endobj 84 0 obj (More thoughts about P, NP, and all that) endobj 85 0 obj > endobj 88 0 obj (The philosophical importance of NP) endobj 89 0 obj > endobj 92 0 obj (NP and mathematical proofs) endobj 93 0 obj > endobj 96 0 obj (What if P =NP?) endobj 97 0 obj > endobj 100 0 obj (What if NP =coNP?) endobj 101 0 obj > endobj 103 0 obj (Chapter notes and history) endobj 104 0 obj > endobj 107 0 obj (Exercises) endobj 108 0 obj > endobj 111 0 obj > stream xڍVKoã6¾çW(§R@Åò)Q=5iºEh±ØuE·Ù’m5²hHt²^ôÇw†¤Åаù˜×7ßæ ƒO¸ FËD ª ‘l7Œ–É.ÁߟoxTÊ¢Vö¢v¿ºùєÉ2Ym/