NP-Complete Problems
half-circle
vector

NP-Complete Problems

Highlights

Step into the area of more complex problems and learn advanced algorithms to help solve them.

This course, part of the Algorithms and Data Structures MicroMasters program, discusses inherently hard problems that you will come across in the real-world that do not have a known provably efficient algorithm, known as NP-Complete problems.

You will practice solving large instances of some of these problems despite their hardness using very efficient specialized software and algorithmic techniques including:

  • SAT-solvers
  • Approximate algorithms
  • Special cases of NP-hard problems
  • Heuristic algorithms

About the Course Provider

edX was established by Harvard and MIT to provide the highest quality education and serves as a leading worldwide online learning platform.

Course by

  • self
    Self paced
  • domain
    Domain IT & Computer Science
  • subs
    Monthly Subscription
    Course is included in
    1. Professional @ AED 149 + VAT
    2. Starter @ AED 99 + VAT
  • fee
    Buy Now AED 529 + VAT
  • language
    Language English