Checklist

Certification

You will get a certificate on completing this course.

University

The course is not from a very prestigious university.

Price

This course is costly - Rs. 10633/-.

Edvicer's Rewards

You can get a reward of 250 coins on buying this course. These coins can be redeemed for 1 coin= 1Re.

NP-Complete Problems

FREE (Audit)
Start anytime
27 hours
English
UCSanDiego
Course by
edXCourses from edX
Certificate awarded
For Rs. 10633
Intermediate
Login to earn 250Edvicer reward coin250 coins = INR 250

Limited Time Discount Offers

Save your money with Edvicer. Check out our premium courses with discount offers.

Discount offers - Edvicer

Limited Time Discount Offers

Save your money with Edvicer. Check out our premium courses with discount offers.

Map your Career

Not sure which job profiles this course will open for you? Check out our AI based tool to get a complete personalized career map.

Career Mapper - Edvicer

Map your Career

Not sure which job profiles this course will open for you? Check out our AI based tool to get a complete personalized career map.

Checklist

Certification

You will get a certificate on completing this course.

University

The course is not from a very prestigious university.

Price

This course is costly - Rs. 10633/-.

Edvicer's Rewards

You can get a reward of 250 coins on buying this course. These coins can be redeemed for 1 coin= 1Re.

Why should you choose this 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

Syllabus

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

What others say about this course

Write your review of NP-Complete Problems

Facebook account of EdvicerLinkedin account of EdvicerInstagram account of Edvicer
Twitter account of EdvicerPinterest account of EdvicerYoutube account of Edvicer