[Free] Fundamentals Of Complexity Theory
Learn about P, NP, NP hard and NP complete problem – Free Course
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
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.
Author(s): Jithin Parakka
FREE
0
