Menu
Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques.
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
NP-Complete Problems
Course Topic
University, College, Institution
Course Language
Place of class
Online, self-paced (see curriculum for more information)
Degree
Certificate
NP-Complete Problems
[display-frm-data id=”8278″ filter=”1″]
More classes & courses