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
Este es un curso introductorio para aprender programación con Java. Java es uno de los lenguajes de programación más usados actualmente. A lo largo de las cinco semanas se introducen pr... more
This introductory course is for anyone who wants a deeper dive into AWS migration. Whether you want to understand what services are helpful, need to plan a migration for your organization, or are... more
Complete your introductory knowledge of computer science with this final course on objects and algorithms. Now that you've learned about complex control structures and data structures, learn to... more
According to Indeed.com in August 2022, the average annual salary for Technical Support is $51,758, though it can go considerably higher. The need for technology is constantly growing, as is the... more
We begin with a study of finite automata and the languages they can define (the so-called "regular languages." Topics include deterministic and nondeterministic automata, regular expressions, and... more
Powered by
