'Pcp log' diaporamas de présentation

CS151 Complexity Theory

619 views • 49 slides

CS151 Complexity Theory

445 views • 30 slides

Umans Complexity Theory Lectures

306 views • 30 slides

The PCP theorem

The PCP theorem. Summary. Proof structure Basic ingredients Arithmetization Properties of polynomials 3-SAT belongs to PCP[O( n 3 ) , O(1)]. Proof structure. 3-SAT ? PCP[log, polylog ]. 3-SAT ? PCP[log, polylog ]. composition lemma. 3-SAT ? PCP[log, polyloglog ].

367 views • 26 slides

Non-Approximability Results

Non-Approximability Results. Summary. Gap technique Examples: MINIMUM GRAPH COLORING, MINIMUM TSP, MINIMUM BIN PACKING The PCP theorem Application: Non-approximability of MAXIMUM 3-SAT. The Gap Technique. P 1 : NPO minimization problem (same for maximization) P 2 : NP-hard decision problem

325 views • 21 slides

Non-Approximability Results

Non-Approximability Results. Summary. Gap technique Examples: MINIMUM GRAPH COLORING, MINIMUM TSP, MINIMUM BIN PACKING The PCP theorem Application: Non-approximability of MAXIMUM 3-SAT. The Gap Technique. P 1 : NPO minimization problem (same for maximization) P 2 : NP-hard decision problem

214 views • 21 slides