SAT to 3-SAT

Loading...
查看授课大纲

您将学习的技能

Python Programming, Linear Programming (LP), Np-Completeness, Dynamic Programming

审阅

4.6(544 个评分)
  • 5 stars
    71.32%
  • 4 stars
    19.66%
  • 3 stars
    5.51%
  • 2 stars
    1.83%
  • 1 star
    1.65%
CS

Aug 26, 2019

Very Very Challenging Course , it test your patience and rewards is extremely satisfying. Lot of learning on a complicated subject of NP-Hard problems.

AS

Jun 15, 2018

Another great course in this specialization with challenging and interesting assignments. However, this one is somewhat harder but rewarding.

从本节课中
NP-complete Problems

教学方

  • Placeholder

    Alexander S. Kulikov

    Visiting Professor
  • Placeholder

    Michael Levin

    Lecturer
  • Placeholder

    Daniel M Kane

    Assistant Professor
  • Placeholder

    Neil Rhodes

    Adjunct Faculty

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。