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
HarvardX: Introduction to Probability
Learn probability, an essential language and set of tools for understanding data, randomness, and uncertainty.
ETHx: Autonomous Mobile Robots
Basic concepts and algorithms for locomotion, perception, and intelligent navigation.
GTx: Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues
Work with the principles of data storage in Arrays, ArrayLists & LinkedList nodes. Understand their operations and performance with visualizations. Implement low-level linear, linked data structures with recursive methods, and explore their edge cases. Extend these structures to the Abstract Data Types, Stacks, Queues and Deques.
CS50’s Introduction to Computer Science
An introduction to the intellectual enterprises of computer science and the art of programming.
DartmouthX, IMTx: C Programming: Language Foundations
Master foundational concepts in the C programming language such as logical statements and arrays.
TokyoTechX: Introduction to Computer Science and Programming
The term “Computation” refers to the action performed by a computer. A computation can be a basic operation and it can also be a sophisticated computer simulation requiring a large amount of data and substantial resources. This course aims at introducing learners with no prior knowledge to the basic key concepts of computer science. By following the lectures and exercises of this course, you will gain an understanding of algorithms by programming using the language Ruby.
There are no reviews yet.