Scribd Logo
Upload

Welcome to Scribd!

  • Ut-5 TH: Funtion - Giue

    Uploaded by

    Pratishta Lucky
    19 views4 pages
    1. NP-hard problems are at least as hard as problems in NP, and can be reduced to problems in P in polynomial time. NP-complete problems are NP-hard and are also in NP. 2. Cook's theorem shows that if any NP-complete problem can be solved in polynomial time on a deterministic Turing machine, then P=NP. This would imply that all problems in NP can be solved in polynomial time. 3. The theorem establishes that the ability to solve even a single NP-complete problem in polynomial time on a deterministic Turing machine would imply P=NP, collapsing the polynomial hierarchy.

    Original Description:

    Original Title

    daa

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. NP-hard problems are at least as hard as problems in NP, and can be reduced to problems in P in polynomial time. NP-complete problems are NP-hard and are also in NP. 2. Cook's theorem shows that if any NP-complete problem can be solved in polynomial time on a deterministic Turing machine, then P=NP. This would imply that all problems in NP can be solved in polynomial time. 3. The theorem establishes that the ability to solve even a single NP-complete problem in polynomial time on a deterministic Turing machine would imply P=NP, collapsing the polynomial hierarchy.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    19 views4 pages

    Ut-5 TH: Funtion - Giue

    Uploaded by

    Pratishta Lucky
    1. NP-hard problems are at least as hard as problems in NP, and can be reduced to problems in P in polynomial time. NP-complete problems are NP-hard and are also in NP. 2. Cook's theorem shows that if any NP-complete problem can be solved in polynomial time on a deterministic Turing machine, then P=NP. This would imply that all problems in NP can be solved in polynomial time. 3. The theorem establishes that the ability to solve even a single NP-complete problem in polynomial time on a deterministic Turing machine would imply P=NP, collapsing the polynomial hierarchy.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 4

    DESIGN ANID ANALYSIS OF ALGORITHMS

    uT-5

    D i Seunding Funtion.Giue th 4laltmunt


    knapack FIFO BB.
    A boundinq Funclion:
    Boundinguncien it falt wway nding uppey
    ad louser boundi or thu opttmal 1olukion w thin a

    asible olutton paCe bounding tunchon ate alw

    belauet doeknt allbw to ewrate o Aub tra hoat hau

    OKnaplatk fIFO BB

    FIFO branth Ond bound is th


    knaptatk wivng
    Mogt Valuabh Aublet tem +hat fit
    ddtminatHoo
    indermg
    ien emu te noan
    1 Kapkak uwu

    othr welghtu vo and


    valuy t

    Deriu h bouwding unttton Aum o ubed


    Probew
    n Y aprelon dHnc Doiie numhars
    MYepTLont u Jum 0 l numbtY

    olutio0 vectov
    euAnt o Hu 4oluto o vector
    eplt
    lor um o dub Aell PYObkM
    boundung Mtion
    henhe

    han
    -X,) tru only
    (X,,X
    and
    X, + M
    i-K

    W:X; +wem
    TET
    S. kvit he Contrel Abubvakion e Least Cot t Braneh
    Omd Beund
    tree
    Au el,TSht. pale
    CO>Cost juncioo tov thu nodes
    lode. in Q trea oe
    X
    aMbotr Mode
    C(x)> Minimum Co 0 aMy

    Oi H T0ot (x)
    CCT) Cogt o an al wer node l +
    M nimum Cot+

    C- A heuwi te funcioo hat ndu C()

    aer ned Or A ua node oh the tv T,


    X an

    n Cx)= CLX)

    and-bound algori H or h job


    ri a branch-
    .
    oith deadtins proolaro
    Aequentdnq

    BB-Jobioq )
    Alaovithm
    A h
    int it ip - 0
    ETo ode in tl 1)
    for (ea th ue
    n

    E t [it+ +]; n
    E-node ucl hat
    qyatn Clold nodes o
    Culdnodlal lonuider D dit erent obe
    diexpmt
    0
    HoYCeach ild nodu
    CoMDu
    h Conu detad jobs.
    Suhet ontainina
    term in S
    Number o
    U P
    i4S
    Upper-mi'n all Ucx)'s
    4 Cod >Opper og x is lnjeasi bla) Tun kill th node x

    elle
    tLipe ax
    n-

    . CoMpare NP-Hard ad NP-Complate Claue

    NP-Haxd NP-C6mplota

    duid ion Probllm P A Aaid to Adaoion Problam P i Aad


    be NPhad, euY problwm to be NP-Comp ut t
    io NP-hord reduted to P NP-had and also in +he
    in Polunomial time. clak P it &ul.

    2. Symbobally+tvaprelanled 2 Sumbelically tte eprelented


    a NP, uahete in P;s OsP->NP.
    Polunomial not oual to P

    3Thle 3 hu prob lemA o prOnt


    Drobum
    mau cov)May
    not be prelantin NPdad inNP dass. (n

    l Problo Canmot he redud . Thele problum lam be


    veelu Cad to NP-hand
    toP- Complote.
    Tle h0tdyi n Tho ae Ju haud s n
    Compabud to NP-Complit Comparud o NP-hond
    Prebluw Problum
    6A PY Oper Aolution Can be oblound
    6 A preper dolutio9 Can not
    to h e pobam by beobainad to u
    0aluy robuu by analyL8
    Cookt-thsovem.
    6 Briy eplain
    huovem tats Hhat i P NP, her
    Cok'
    We inP
    Aahspiability
    is tn lp. Hu
    39 Knout hat Aakc(iab:lily
    PNP an Aakiabiy
    in P
    Vevdoi idalic iability i n P,
    And allo vice

    +hen P NP
    o Proue thi, Q(A,D) has to be formulalad io
    alaorith m A aMo
    time nondoterwinisha
    o levomi al
    input .
    n and e time
    llun +hu lbugth o input
    APCo).
    Covpluyvity o algoriho
    Then u ngth G 0Cpnlogn) OCp"Ch)) and
    dutwiminisHe algoriho diuwiinu awd ohahw
    4at u 40tstlabl o not
    db ovmulale Lg+h m is
    olytm) i tima Yeauivad
    akiiabl e n u lomplavity o alovi#hm O
    OCpCn) loan + p' tn) loq n ),
    Han ha omplexiy a Polynomial
    te
    4 P, is at'stiabla
    to Crln)).
    ownCtron ill
    in, thun delomin'she
    leua, i aobiuy i ound
    a

    be bblauned fov
    eatk o; h o vendekr
    D in ? Cam
    A in NP.
    Minigie algovi hm
    s i n P hen
    Thul, i aiseabiby
    PP

    You might also like