Udemy
    •  
    •  
    •  
    •  
    •  
    •  
    •  
    •  
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
Fundamentals of complexity theory
Rating: 3.9 out of 5(33 ratings)
2,023 students
Created byJithin Parakka
Last updated 4/2020
English

What you'll learn

  • Complexity classes P, NP, NP hard and NP complete problem
  • Circuit Satisfiability problem
  • SAT problem
  • 3 CNFS SAT problem
  • Clique Problem
  • Vertex Cover Problem
  • Hamiltonian Cycle problem
  • Traveling salesman problem

Course content

1 section11 lectures52m total length
  • Introduction4:59
  • Complexity classes3:35
  • Reducebillity2:40
  • P=NP1:16
  • Circuit satisfiability3:57
  • Boolean satisfiability problem7:13
  • 3 CNF SAT problem4:59
  • Clicque problem9:47
  • Vertex cover problem7:34
  • Hamiltonian cycle problem2:16
  • Traveling Salesman Problem4:39

Requirements

  • Concept in graph theory, and algorithms

Description

Yes, computers are really fast.

They can solve complex problems within a matter of seconds.

But there are some problems that can't be solved by computer quickly, those problems are called hard problems.

Those problems remain as a hard problem since still, we are not able to develop an efficient algorithm to solve such problems.

Want to learn about such problems? Join this course.

Who this course is for:

  • Computer Science students
  • Programmers