Price:
5012 EUR
Contact
Stanford University
Description
The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).
Specific details
Category of Education
Computer Sciense and IT
How to resolve AdBlock issue? 
Comments (0)