NP Hoard and NP_ eee Types. sil _pecblems i= dh #ti 's Decision pas blem Bes The problem for which “anwer. fe O of i js culled decision problem such psieon is called _clesision__aljonthm ge | Optimization Problem ¢- eld ___The problems that involves _jdentiticahon oF. optima) volue oF given cost Funckon Know as oplirizaton peblem algonthm {stalled optimization ime Olgetithm :— Hl \gormitnn Fos a iven pxvb] ery Id. to be polynomial He algonthm Complexity belongs. toae "iNen plum time _cllyoxi tara t= | 2 2 algorithm Fora _given_pRblem i is _soid tp be non polynomial time _ alyoathm 1 \b time — complexity ae belongs. eG) a ae a eq 2s re ing “Sale person parblem — 2 Bniniarest ISeidieyeees sor u Knupsock pravblem 3 Pond NP -9- Di ige he: class st decision prblemy thot ove solvable in Polynomia) = ¥ime. by deterministic cilgenthm:agar —Np hard ond NP Complete :- eee Np How 3- ma ; A decision problem __ PTs. NP Thad 1b evey problem 19. NP js “plynomidl time _yeducable_to_ Pi ythen [Pimssoidavtnieche sin Piibnsr cvs Cs NP Complete :- SEY)| _ 7 Erample= Br nee Hosd: Travelling — Salapeson ean _2)| vortex Neoves Problem — == Pale complete _Extmple S| Hamittenien cycle a a ae iL #_ | @pokt theorem g— Bu Cooks -theorern states that — "Boolean Salis babi lity ee is np- Complete = Prot _e- FOOVING Coola_theorem . inyolver dlemonstiating two main Gipect _oe: 4 > showy SPA Tis ee IN ph : “Given an Assignment of _ tot a L values — _te variables it~ can be _ vonitied aim _psynomial Hime whether the oo _satistie Hine boolean, —_— | Hime educhon Bes At es | Cool. showed that ny bler ip NP @n be —polynomia| time reduced 42 spt Tics. s__on cae baton ane wla - T+ jpvolvey Q Coreful \ to __ensuye one - te -0Ne seul tiny sht_ intone. _ Be ore otive Tb Dn CE y a Ryo Proesve Sapshabilityt- | Guatontee_ tha original problem — has the — solulion ‘Hs “and on Ny ob | the Yulin Nt inlanee is! oo —+ SymeObieee fete) ee ee { Cooler theosend twugh His = poof lays the foundalon’= for the Study__of NP-Completnals and prvidy mee canden lending oF rela tons cep Computatona bo) i —__{the Np- ae pe ae BB ee. anh dsbwmatic Number Decsion Pibiom 7 Chwrnatic. Dumber y the” “minim Tpumber 0b colo requived — to in calor ony —qrcuph. such Hat oe pred 1 ye ee Ore ALigne) the 2 a ouy Fis colouring graph “Gey #8) sdhobing. K , Aetined toe ail je vi The _chromahics number deaision plem 13 10 determing - wWhethey’ G coloutiny Por a given Ie _ Posiible tuo a % the “graph eee the ti ait Galaxy M32|The chomatic graph. decision _peblem Tinvolves__determi ning tre —tniNimnamn _ y ov bee numbed? ob sealord to coloy the = = Vee pb a Given graph. ‘in Such LQ way thet weg ene eo. = vertices share Cicloch. | The deson ean pus heh ¢_graph__can be © hae" uth led tain umber clo Fewer, Tt iy _dossic | pwblem in gene theory _toitn appli icaHons ‘in ein mop “Closing and Yeoure allocation ail S10 @ Np- ete meaning there iy no known ebticent alanitnm to solv: Lit Fx _all__coses i Doi i ——Considts tine Gruph with 2 : 7: a. —— 0 awitwot bs 6 Jo —Coloy the graph. you stast by ass) Bg “| egloss te the vetces such thot mo two * —Fadyacent Vere have Same color. here one a“ AN) eae TF vewlex 1 = = Red vertex 2 -— Green vertex - Red ae __vetker ¢= Green. Here we need on two coloy to gaph hence closwmatic number, t ee eredTeac ee an 2 a ek at E | ar lique isa subgrmph ob a « mn eohiche iss complete eee Se i - : Sox a ee lah Sgt In +he above Pees 1 po ee 5 oO Subayoph o& cohich 5 complet BS geash Neneh Ty Qa “clique” ot rs graph E Th_o_aph ony navies oe Clique cun he preven} G eee 9 clique 2 ; :=| 7 “yhert ave mony chave promt im the iver pe q , Kes e390 - Finding a < Ob clique ob size Je | E is decision problem ond tindin E | peaximun SY Minimum — stize ob clique 4 Ti optimization prblen, F Pasng_Ctigne, Decision Prblern Copp ) P_havd _ CpP_as NP hod we dey a _poblem which i NP hod 2-4 here_we wil ability _p (GSA -@ gaphubornd [Ee as fhpeapoeelt 0 graph | above tarmula_,—‘talse—O- svextice vib At | ee ae ae sree ce eee i ___ Wray bene ee. gota 2 %2_0 oumgs | to _sclect the Second -yoriable we a | false Clowe number bs X) Xo belongs to couse 4 go Wk i coll wnte then Os Cxplind) G@xapyb2) a a aa wll ger. CR CBee Cho, 3) { So ee will___berome 3 Rey Sey 7“y oS Ruler to connect Vertces you should not _c |_surme_ CVA sels We con. not Connect Xk, and x | Kp Ke sandi ie, boxe Mou should not connect svestex with ib Dep lon > Means we con not Connect KE 4K Ky Kp to XK and | Xe do Ke Connect the clauses :~ nnect veshces ob | CK 1 2 — (% 2 Dye 0G 5055 2) See Cry 3) By) 1c 3 2) ee OmCabsieler tne clicie'se with — clattal F sacs leew de gta Comiaeins For nantlo:, qi) stort bivurls — __ | BGS pare ena XSF y oo dotted clique -Hre values = ish x, Sx, and x3 will be css) BUS Vix Yb. >| 5 Mig att ie. ee _ Se eee RRS oat t(D) | A Put_the_obove value ing given torr lg_ | 2. @VID ARGV) A (ow)