Overview
Step into the area of more complex problems and learn advanced algorithms to help solve them.
This NP-Complete Problems Certificate at University of California, San Diego - UC San DiegoX, which is 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
What you'll learn
- 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
Programme Structure
Courses include:
- NP-Complete Problems
- Coping with NP-completeness: special cases
- Coping with NP-completeness: exact and approximate algorithms
Key information
Duration
- Part-time
- 21 days
- 8 hrs/week
Start dates & application deadlines
Language
Delivered
- Self-paced
Campus Location
- Portland, United States
Disciplines
Mathematics Applied Mathematics Information Technology (IT) View 15 other Short Courses in Applied Mathematics in United StatesWhat students do after studying
Academic requirements
We are not aware of any specific GRE, GMAT or GPA grading score requirements for this programme.
English requirements
We are not aware of any English requirements for this programme.
Other requirements
General requirements
- Intermediate
- Some prior experience required
Tuition Fees
-
International Applies to you
Applies to youNon-residents150 USD / full≈ 150 USD / full - Out-of-State150 USD / full≈ 150 USD / full
Additional Details
- Unlimited access + verified certificate: $150
- Limited access: free