NP-Complete Problems
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 algorithmsCreated by: The University of California, San Diego
Level: Intermediate
Related Online Courses
Robotics and AI are all around us and promise to revolutionize our daily lives. Autonomous vehicles have a huge potential to impact society in the near future, for example, by making owning private... more
A follow-on to Intro to QC for Everyone 1, this course delves deeper into the mathematical basis for quantum computing and the programming that makes it a reality. Students will be taught all of... more
Developers working in cloud native teams face the challenge of shuffling between microservices, external APIs, libraries, and other software components. Developer portals like Backstage can help... more
Housing and Cities is a design-oriented architecture course that focuses on key moments of European urban housing history. It looks into ordinary or replicated housing types of different social... more
Build on your existing knowledge of conditionals, loops, and functions by studying more about complex Python data structures, including strings, lists, dictionaries, and file input and output.... more
Powered by
