Scribd
Upload
4 views

Algorithm_Unit_5

The document discusses computational complexity, specifically focusing on P and NP classes of problems. It highlights the characteristics of polynomial time solvable problems and provides examples such as Sudoku and the 15-puzzle problem. Additionally, it touches on algorithms for solving these problems, including branch and bound techniques.

Uploaded by

ensavithavinothkumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Algorithm_Unit_5

The document discusses computational complexity, specifically focusing on P and NP classes of problems. It highlights the characteristics of polynomial time solvable problems and provides examples such as Sudoku and the 15-puzzle problem. Additionally, it touches on algorithms for solving these problems, including branch and bound techniques.

Uploaded by

ensavithavinothkumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

uit -

Complele and approimaton Algo-ih

cornp utalional
comploity
P- das |NP-clas

NP complle p had
P- Pwblem

poblem cwhich be solved


polynomiad tino
A[io]x
X < A

< Sinp lo potblorn

A ’Algozithm
x > Sawing problem.
set problom that Can b.0

Sodveol by

determonis tie twung mechine


palynomial time
Np Cnon doleminis ti poly romial ine
von dlerminis tic polynomial tone
Ven
diagram
np hatd

Roduee

comy lelo
plass
Sodwe
Fay to venety Easy
Lunoan and binay Seanch
dass
Had Salwe
to Easy to venily
EX Sucoku, TsP, tamilonian

I5 - pazzle problern

3 2
15 runbns
b.
7

I5 12
(

gwen aangement
Gioal argenent
Leost Banch Bourd lLB9)
cCx) = F(x) t g (x)
(Cx) ’ Estimoto miunm. cost to reach

moves stales
6loclcs rot posileen

1. down

3. le<t
right
(5 |2

down
2 3

9 (o
qlo 7 )
15
122
(3 (3 (3 l 5 12

Count =| 2 (t
Cmgly 3 5
Spare
moverMont best.

(3 (4 15 (2

dowo
2 4 2 3
5 5

(0-15
13 14 12 13 13 (5 19
3 13 12

let movement best


2 3
5 6 7

13

down

5 6
|2

3 iu (5 (2 (3 l4 l5 12

19

movement best
Trow elling Salos man Pyoblen (hranch &
bond )

Nooe o
(it8)
b ’ ab t bc (8+b)

d > Cd t de = (4t3)
(2 + 8)

a’b

b > ab t bC

d Cd + de
ce t ed
28
Nooe 2

b ab + b = 4
e> al (e = 3

d Cd + de
e Ce + de =

28/2

Q ad + ac = 6
b > aht b
C> ac t Ce
d ad +de

31

15. 5 - l6 LB

Nocle
a >e

ab + 6c

d ’ cd t de
ae
LB
a>d
a>c
NDEle 3
LB14 LB ILp. LB b

a >be

Node 5
L8-Ib LB 20

a>bc>d

Noclo
LB 17
NDzo 5:

d > Cd t de
e ’ ce + de
32

LB

vb> ab tb d
3
wd

32
= lb LB

Node:

ab +ee 13

39

Qo LB

b ab tbC- q
35
35/9 l8 LB
NDule

b ab +bC= q

e Ce t de 6
33

38/2 = 16

b ’ a b t bC = q

d > ed + de - 7

33

33/, - lb

You might also like