Longest Path Problem

Loading...
Ver programa

Destrezas que aprenderás

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

Reseñas

4.6 (544 calificaciones)
  • 5 stars
    71.32%
  • 4 stars
    19.66%
  • 3 stars
    5.51%
  • 2 stars
    1.83%
  • 1 star
    1.65%
CS
25 de ago. de 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
14 de jun. de 2018

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

De la lección
NP-complete Problems

Impartido por:

  • Placeholder

    Alexander S. Kulikov

    Visiting Professor
  • Placeholder

    Michael Levin

    Lecturer
  • Placeholder

    Daniel M Kane

    Assistant Professor
  • Placeholder

    Neil Rhodes

    Adjunct Faculty

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.