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
In this Capstone course, you will apply your skills and knowledge acquired in previous courses and demonstrate your proficiency in DevOps practices. You’ll plan, develop, test, deploy, monitor, a... more
How do you protect the critical data that is increasingly being stored in the cloud? Learn how to build a security strategy that keeps data safe and mitigates risk. In this course, part of the... more
About the Database Series of Courses "Databases" was one of Stanford's three inaugural massive open online courses in the fall of 2011. It has been offered in synchronous and then in self-paced... more
The Internet of Things is creating massive quantities of data, and managing and analysing it requires a unique approach to programming and statistics for distributed data sources. This course will... more
Open source networking projects are transforming how service providers and enterprises develop, deploy, and scale their networks and next-generation services. The Open Network Automation Platform... more
Powered by
