• No products in the cart.

There are ways to solve problems and knowing what practical approaches can be utilized is beneficial to solve problems efficiently. Proving problems involves learning how reductions and techniques for problem-solving can be hard.

Through this [course_title] you are provided with the hardness proofs that you can use with algorithmic lower bounds. You can actually create a game out of it through knowing the solutions addressing problems and complexity issues.

### Assessment

This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.

### Certification

Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.

Having an Official Edukite Certification is a great way to celebrate and share your success. You can:

• Show it to prove your success

Course Credit: MIT

### Course Curriculum

 Module: 01 Lecture 1: Overview 01:20:00 Lecture 2: 3-Partition I 01:23:00 Lecture 3: 3-Partition II 01:21:00 Lecture 4: SAT I 01:20:00 Lecture 5: SAT Reductions 01:22:00 Module: 02 Lecture 6: Circuit SAT 01:19:00 Lecture 7: Planar SAT 01:23:00 Lecture 8: Hamiltonicity 01:21:00 Lecture 9: Graph Problems 01:20:00 Lecture 10: Inapproximabililty Overview 01:18:00 Module: 03 Lecture 11: Inapproximability Examples 01:20:00 Lecture 12: Gaps and PCP 01:23:00 Lecture 13: W Hierarchy 01:21:00 Lecture 14: ETH and Planar FPT 01:23:00 Lecture 15: #P and ASP 01:23:00 Module: 04 Lecture 16: NP and PSPACE Video Games 01:18:00 Lecture 17: Nondeterministic Constraint Logic 01:20:00 Lecture 18: 0- and 2-Player Games 01:21:00 Lecture 19: Unbounded Games 01:23:00 Lecture 20: Undecidable and P-Complete 01:23:00 Module: 05 Lecture 21: 3SUM and APSP Hardness 01:19:00 Lecture 22: PPAD 01:21:00 Lecture23: PPAD Reductions 01:23:00 Assessment Submit Your Assignment 00:00:00 Certification 00:00:00

## 4.7

4.7
9 ratings
• 5 stars0
• 4 stars0
• 3 stars0
• 2 stars0
• 1 stars0

No Reviews found for this course.

441 STUDENTS ENROLLED