NP-Complete Problems

Add to Favourites
1 1 1 1 1
Price: 650 EUR 650 EUR
Contact University of California, San Diego

More details about the program

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

Specific details

Category of Education Computer Sciense and IT

Comments (0)

There are no comments posted here yet

Leave your comments

Search

Related Programs

This course provides demonstrations and exercises ...
Every time you use Google to search something, eve ...
Machine learning is the science of getting compute ...
This course introduces computational concepts that ...

 

©2023 EDUCOM NET. All Rights Reserved.

If you find an inaccuracy or you have comments on the description of the university or program - please let us know info@educom.net