We aren't endorsed by this school 
CSE 8813  Mississippi State Study Resources

Rittu_toc1
School: Mississippi State
Theorem 8.19 If algorithm Ahas absolute approximation ratio RA, then the shifting algorithm has absolute approximation (KRA+1)/(K+1) Proof. If N is the number of disks in some optimal solution. Since A yields RAapproximations, the number of disks ret

Presentation_Benjamin2
School: Mississippi State
No Guarantee Unless P equals NP Benjamin Daggolu Theorem 8.23 For each problem in NP, there is a polynomialtime map f from instances of to instances of Max3SAT and a fixed > 0 such that, for any instance x of , the following implications hold:

TOCJansen
School: Mississippi State
From Decision to Optimization and Enumeration 7.3.1 to 7.3.3 7.3.1 TURING REDUCTIONS AND SEARCH PROBLEMS In the Beginning When studying complexity theory we generally restrict our problems to decision problems. This is done to ease the study. We

Lalitha_presentation1
School: Mississippi State
 Lalitha Pragada. Proposition 8.1: Vertex Cover remains NPComplete when limited to graphs of degree 5. Restriction to planar graphs. Proof of NPCompleteness: By reduction from one of the versions of 3SAT. Constructions from 3SAT: 1. A part( 1 fr

Sai_Divya_Enni_presentation1
School: Mississippi State
8.3.2 ConstantDistanceApproximations Sai DivyaEnni Westartwiththestrictestofperformanceguaranteesthat approximationremainswithinconstantdistanceofthe optimalsolution. Onthebasisofthisguaranteewecansaythatfindingoptimal solutioncanbecomeeasierthati

Lalitha_presentation2
School: Mississippi State

Adam_Jones_presentation1
School: Mississippi State
8.2 Strong NP Completeness Adam Jones jaj33@cse.msstate.edu CSE 8813, Theory of Computation Fall 2008 General/Restricted Cases There exists no known generalizable algorithm for tractably solving problems of the class NP. Though these problems ar