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
The aim of this course is to equip learners with advanced skills in network automation and make them industry ready. In this course, you will learn about SDN Deployment. The course has been... more
Reduction of energy consumption of buildings is an important step in the move towards a sustainable economy. How can buildings be made net zero energy, in different climates? This course... more
Modern software is under constant attack, but many software developers have never been told how to effectively counter those attacks. This course works to solve that problem, by explaining the... more
This course is one of the 5 courses of an introductory business information systems series, designed to introduce you to the amazing world of Information Technology. The series of courses is... more
The course is based on the text Mining of Massive Datasets by Jure Leskovec, Anand Rajaraman, and Jeff Ullman, who by coincidence are also the instructors for the course. The book is published by... more
Powered by
