Information Technology
Hands on Training icon
Hands On Training
Hands on Training icon

NP-Complete Problems

Course Cover
University of California, San Diego

via

edX
compare button icon

Course Features

icon

Duration

3 weeks

icon

Delivery Method

Online

icon

Available on

Limited Access

icon

Accessibility

Mobile, Desktop, Laptop

icon

Language

English

icon

Subtitles

English

icon

Level

Intermediate

icon

Effort

10 hours per week

icon

Teaching Type

Self Paced

Course Description

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

Course Overview

projects-img

International Faculty

projects-img

Post Course Interactions

projects-img

Instructor-Moderated Discussions

Skills You Will Gain

Prerequisites/Requirements

Basic knowledge of at least one programming language and material of the Algorithmic Toolbox, Data Structures and Algorithms on Graphs classes.

What You Will Learn

How to approximate algorithms

How to use heuristic algorithms to solve a problem more quickly when classic methods are too slow

NP-completeness and how to deal with it

Course Instructors

AS

Alexander S. Kulikov

Visiting Professor

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.
DK

Daniel Kane

Assistant Professor, Computer Science and Engineering & Dept. of Mathematics

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.
Course Cover
Home
Search
Wishlist