23. Computational Complexity
MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Erik Demaine
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 23. Computational Complexity канала MIT OpenCourseWare
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Erik Demaine
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 23. Computational Complexity канала MIT OpenCourseWare
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
16. Complexity: P, NP, NP-completeness, ReductionsIntroduction to Big O Notation and Time Complexity (Data Structures & Algorithms #7)19. Dynamic Programming I: Fibonacci, Shortest Paths22. Emergence and ComplexityBeyond Computation: The P versus NP question (panel discussion)Алгоритмы на Python 3. Лекция №114. Depth-First Search (DFS), Topological SortComputational Complexity Theory in a NutshellP vs. NP and the Computational Complexity ZooLec 1 | MIT 6.042J Mathematics for Computer Science, Fall 20108. Hashing with Chaining24. Topics in Algorithms Research10. Understanding Program Efficiency, Part 121. DP III: Parenthesization, Edit Distance, KnapsackThis is the BOMB to worry about7. Counting Sort, Radix Sort, Lower Bounds for SortingWhat is complexity theory? (P vs. NP explained visually)11. Dynamic Programming: All-Pairs Shortest PathsSelf Taught Programmers... Listen Up.13. Breadth-First Search (BFS)