You are on page 1of 11

Advanced Topics in Theoretical

Computer Science
Sarfraz Ali Shahani
Literal Definition

One of the Definition of Cook Leven


Theorem:
A decision problem is in NP if it can be solved
by a non-deterministic algorithm in polynomial
time.
Cook-Levin Theorem:
Language SAT (satisfiability problem) is NP-
complete
Pre-requisites

Polynomial / Non-Polynomial

Satisfiability Problems
Linear Search n 0/1 Knapsack n2

Binary Search Log n Traveling Salesman n2

Insertion Sort n2 Sum of Subsets n2

Merge Sort n log n Graph Coloring n2

Matrix Multiplication n3 Hamiltonian Cycle n2

NP

P
The Objective

1) Partial Solution (That may be reused by


others)

2) Try to find out relevancy among the NP


Time problems
Thank you