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 course you will start by identifying the different steps a HVAC (Heating, Ventilation and Air Conditioning) engineers need to follow to come to a proper design while collaborating with the... more
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
El mayor activo de las empresas actuales son sus datos, datos que, mayoritariamente se alojan en bases de datos relacionales en línea. Prácticamente todos los sistemas de gestión de bases de da... more
Within this course, you’ll learn about how PostgreSQL creates and uses inverted indexes for JSON and natural language content. We will use various sources of data for our databases, including a... 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
Powered by
