NP-Complete Problems

Обучение бесплатное
Сертификация платная
2 часа курса
О курсе

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 algorithms
NP-Complete Problems
Learn about NP-complete problems, known as hard problems that can’t be solved efficiently, and practice solving them using algorithmic techniques.
Что Вы изучите?
  • NP-completeness and how to deal with it
  • How to approximate algorithms
  • How to use heuristic algorithms to solve a problem more quickly when classic methods are too slow
Daniel Kane
Daniel Kane
Assistant Professor, Computer Science and Engineering & Dept. of Mathematics UC San Diego
Daniel is an assistant professor at UCSD with a joint appointment between the Department of Computer Science and Engineering and the Department of Mathematics. He holds B.S. from MIT and Ph.D. from Harvard.
Alexander S. Kulikov
Alexander S. Kulikov
Visiting Professor UC San Diego
Alexander is a research fellow at Steklov Mathematical Institute at St. Petersburg, Russia and a visiting professor at University of California, San Diego. He have been teaching algorithms classes for more than eight years.
Эта платформа предоставляет все курсы бесплатно. Авторами выступают топовые университеты и корпорации, которые стараются удерживать стандарты качества. За несоблюдение дедлайнов, невыполнение домашнего задания студенты теряют баллы. Как и в других платформах, лекционные видео чередуются с практическими заданиями. Обучение проводится на английском, китайском, испанском, французском и хинди.
NP-Complete Problems