UCSanDiegoX: NP-Complete Problems
|
Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques.
About this course
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
At a Glance:
Institution: UCSanDiegoX
Subject: Computer Science
Level: Intermediate
Prerequisites:
Basic knowledge of at least one programming language and material of the Algorithmic Toolbox, Data Structures and Algorithms on Graphs classes.
Language: English
Video Transcript: English
Associated programs:
MicroMasters® Program in Algorithms and Data Structures
Associated skills:Data Structures, Np Complete, Np Hard, Algorithms
User Reviews
Be the first to review “UCSanDiegoX: NP-Complete Problems”
Related Products
MITx: Understanding the World Through Data –
Become a data explorer – learn how to leverage data and basic machine learning algorithms to understand the world.
HarvardX: CS50’s Introduction to Artificial Intelligence with Python
Learn to use machine learning in Python in this introductory course on artificial intelligence.
GalileoX: Java Programming Fundamentals
Your career as a program developer starts here. Gain entry-level programing skills in Java language, and prepare yourself to handle any task that is required in any programming job.
AdelaideX: Computational Thinking and Big Data
Learn the core concepts of computational thinking and how to collect, clean and consolidate large-scale datasets.
GTx: Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms
Delve into Pattern Matching algorithms from KMP to Rabin-Karp. Tackle essential algorithms that traverse the graph data structure like Dijkstra’s Shortest Path. Study algorithms that construct a Minimum Spanning Tree (MST) from a graph. Explore Dynamic Programming algorithms. Use the course visualization tool to understand the algorithms and their performance.
CS50’s Introduction to Computer Science
An introduction to the intellectual enterprises of computer science and the art of programming.
There are no reviews yet.