Scribd
Upload
12 views

Lesson 8 Complexity Theory and DP

The document discusses complexity theory and dynamic programming. It defines key complexity classes like P, NP, and NP-complete problems. P problems can be solved in polynomial time, while NP problems cannot necessarily be solved quickly but can be verified quickly. NP-complete problems are the hardest problems in NP. Dynamic programming is described as a technique that breaks problems into optimal subproblems and stores solutions to avoid recomputing them. It involves characterizing optimal solutions, recursively defining values, and computing the optimal solution bottom-up. Applications include knapsack, shortest paths, and longest common subsequence.

Uploaded by

Timothy Awinia
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
12 views

Lesson 8 Complexity Theory and DP

The document discusses complexity theory and dynamic programming. It defines key complexity classes like P, NP, and NP-complete problems. P problems can be solved in polynomial time, while NP problems cannot necessarily be solved quickly but can be verified quickly. NP-complete problems are the hardest problems in NP. Dynamic programming is described as a technique that breaks problems into optimal subproblems and stores solutions to avoid recomputing them. It involves characterizing optimal solutions, recursively defining values, and computing the optimal solution bottom-up. Applications include knapsack, shortest paths, and longest common subsequence.

Uploaded by

Timothy Awinia
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Complexity theory

Definition of NP class Problem: - The set of all decision-based problems came into the
division of NP Problems who can't be solved or produced an output within polynomial time
but verified in the polynomial time. NP class contains P class as a subset. NP problems
being hard to solve.
Definition of P class Problem: - The set of decision-based problems come into the
division of P Problems who can be solved or produced an output within polynomial time. P
problems being easy to solve
Definition of Polynomial time: - If we produce an output according to the given input
within a specific amount of time such as within a minute, hours. This is known as
Polynomial time.
Definition of Non-Polynomial time: - If we produce an output according to the given
input but there are no time constraints is known as Non-Polynomial time. But yes output
will produce but time is not fixed yet.
Definition of Decision Based Problem: - A problem is called a decision problem if its
output is a simple "yes" or "no" (or you may need this of this as true/false, 0/1,
accept/reject.) We will phrase many optimization problems as decision problems. For
example, Greedy method, D.P., given a graph G= (V, E) if there exists any Hamiltonian
cycle.
Definition of NP-hard class: - Here you to satisfy the following points to come into the
division of NP-hard
If we can solve this problem in polynomial time, then we can solve all NP problems in
polynomial time
If you convert the issue into one form to another form within the polynomial time
Definition of NP-complete class: - A problem is in NP-complete, if
• It is in NP
• It is NP-hard
Dynamic programming

Dynamic Programming is the most powerful design technique for solving optimization
problems.
Divide & Conquer algorithm partition the problem into disjoint subproblems solve the
subproblems recursively and then combine their solution to solve the original problems.
Dynamic Programming is used when the subproblems are not independent, e.g. when
they share the same subproblems. In this case, divide and conquer may do more work
than necessary, because it solves the same sub problem multiple times.
Dynamic Programming solves each subproblems just once and stores the result in a table
so that it can be repeatedly retrieved if needed again.
Dynamic Programming is a Bottom-up approach- we solve all possible small problems
and then combine to obtain solutions for bigger problems.
Dynamic Programming is a paradigm of algorithm design in which an optimization
problem is solved by a combination of achieving sub-problem solutions and appearing to
the "principle of optimality".
Stages: The problem can be divided into several subproblems, which are called
stages. A stage is a small portion of a given problem. For example, in the shortest
path problem, they were defined by the structure of the graph.
States: Each stage has several states associated with it.
Decision: At each stage, there can be multiple choices out of which one of the best
decisions should be taken.
Optimal policy: It is a rule which determines the decision at each stage; a policy is
called an optimal policy if it is globally optimal. This is known as Bellman principle of
optimality.
Given the current state, the optimal choices for each of the remaining states does
not depend on the previous states or decisions.
There exist a recursive relationship that identify the optimal decisions for stage j,
given that stage j+1, has already been solved.
The final stage must be solved by itself.
Development of Dynamic Programming Algorithm

It can be broken into four steps:


Characterize the structure of an optimal solution.
Recursively defined the value of the optimal solution. Like Divide and Conquer, divide
the problem into two or more optimal parts recursively. This helps to determine what the
solution will look like.
Compute the value of the optimal solution from the bottom up (starting with the smallest
Applications of dynamic programming

Matrix chain multiplication problem O(pqr)


knapsack problem (0/1 and fractional knapsack)
Mathematical optimization problem
All pair Shortest path problem
Reliability design problem
Longest common subsequence (LCS)
REFERENCE MATERIALS

1. The design and Analysis of Computer Algorithms by AHO/Hocroft Ullman


2. Design and analysis of Algorithms by Russell L Shackelford
3. Introduction to the Design and Analysis of Algorithms by R.C.T Lee, S.S Tseng Chang
Y.T Tsai
4. Judith L GerstingMathematical Structures for computer science 4th edition

You might also like