Longest Path Problem

Loading...
Ver programa

Destrezas que aprenderás

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

Reseñas

4.6 (580 calificaciones)
  • 5 stars
    71.72%
  • 4 stars
    19.13%
  • 3 stars
    5.17%
  • 2 stars
    1.89%
  • 1 star
    2.06%
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.

YC
14 de may. de 2019

This is a very challenging course in the specialization. I learned a lot form going through the programming assignments!

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.