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
Prototyping is part art, part science. In this MOOC you will learn both UI design (user interface design) and the ergonomic criteria (grounded in cognitive psychology), which underlies it. With... more
Technology and computers are becoming more and more capable every day. Moving forward, computers will become increasingly good at solving problems. That means humans will become the problem finders... more
Never before has the video game market been at a better time. There are currently many platforms available and the emergence of mobile devices has revolutionized the sector. The existence of... more
Podemos afirmar sin temor a equivocarnos que un buen curso de Cálculo amplía la visión del estudiante en su campo y en su área de estudio. El Cálculo Diferencial es el lenguaje en el que algu... more
Este es un curso destinado a profesores de todos los niveles. En él aprenderás a sacar partido de las nuevas tecnologías en tu labor docente para crear una experiencia de aprendizaje nueva y en... more
Powered by
