Brief Introduction
Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques.Description
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
Knowledge
- NP-completeness and how to deal with it
- How to approximate algorithms
- How to use heuristic algorithms to solve a problem more quickly when classic methods are too slow
Computability, Complexity & Algorithms
- 0.0
-
![]()
![]()
![]()
![]()
![]()
You will learn a wealth of tools and techniques that will help you recognize when problems you encounter in the real-world are intractable and when there an efficient solution....
Introduction to Graduate Algorithms
- 0.0
-
![]()
![]()
![]()
![]()
![]()
The design and analysis of algorithms form an essential basis for computer science. Learn advanced techniques for designing algorithms and apply them to hard computational problems....
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
- 4.8
-
![]()
![]()
![]()
![]()
![]()
Week 1 Single-Source Shortest Paths, Revisted Optimal Substructure The Basic Algorithm I The Basic Algorithm II Detecting Negative Cycles A Space Optimization...
Advanced Algorithms and Complexity
- 4.6
-
![]()
![]()
![]()
![]()
![]()
You've learned the basic algorithms now and are ready to step into the area of more complex problems and algorithms to solve them....
