Scribd
Upload
55 views30 pages

373 Lecture 12

This document defines and explains key concepts related to complexity analysis of algorithms including best case, worst case, and average case running times. It discusses asymptotic analysis and Big-O notation for describing how algorithm running times grow relative to input size. Specific algorithm problems are analyzed including quadratic algorithms, the complexity classes P and NP, NP-completeness, and the Cook-Levin theorem showing SAT is the first NP-complete problem.

Uploaded by

api-3696125
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
55 views30 pages

373 Lecture 12

This document defines and explains key concepts related to complexity analysis of algorithms including best case, worst case, and average case running times. It discusses asymptotic analysis and Big-O notation for describing how algorithm running times grow relative to input size. Specific algorithm problems are analyzed including quadratic algorithms, the complexity classes P and NP, NP-completeness, and the Cook-Levin theorem showing SAT is the first NP-complete problem.

Uploaded by

api-3696125
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 30

Complexity

By
Javed Siddique
What does Complexity Mean
Definition
• Best Case
• Worst Case
• Average Case
• Running Time or Time Complexity
• Asymtotic Analysis.
• Big-O Notation.
Definition
Analysis O(n^2)
Definition
Class P
Example
Class NP
Verifier
Nondeterministic Polynomial
Hamiltonian Path
P VS NP
NP Completeness
Satisfiability Problem
Cook-Levin Theorem
Polytime Reducability
Theorem
3CNF
Theorem
3CNF Proof
3CNF Proof
Definition

You might also like