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
Develop a good working knowledge of Linux using both the graphical interface and command line, covering the major Linux distribution families. Linux powers 100% of the world’s supercomputers, m... more
Information technology (IT) can be viewed as a system, a combination of independent parts all working together to accomplish a certain goal. Systems are everywhere. For example, the respiratory,... more
From cars that drive themselves to robots that restock the warehouse and sensors that know when it’s time to water or fertilize crops, our world is changing right before our eyes. This is digital t... more
For over 25 years, SOLIDWORKS has been the trusted industry standard in mechanical design and engineering. Intuitive 3D modeling and product development solutions from SOLIDWORKS help you... more
Building on your prior knowledge of variables and operators, this course gets into the meat of programming. Organized into five chapters, this course starts by covering the fundamentals of what... more
Powered by
