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, Reductions](https://i.ytimg.com/vi/eHZifpgyH_4/default.jpg)
![Introduction to Big O Notation and Time Complexity (Data Structures & Algorithms #7)](https://i.ytimg.com/vi/D6xkbGLQesk/default.jpg)
![19. Dynamic Programming I: Fibonacci, Shortest Paths](https://i.ytimg.com/vi/OQ5jsbhAv_M/default.jpg)
![22. Emergence and Complexity](https://i.ytimg.com/vi/o_ZuWbX-CyE/default.jpg)
![Beyond Computation: The P versus NP question (panel discussion)](https://i.ytimg.com/vi/AszEVlfVoSc/default.jpg)
![Алгоритмы на Python 3. Лекция №1](https://i.ytimg.com/vi/KdZ4HF1SrFs/default.jpg)
![14. Depth-First Search (DFS), Topological Sort](https://i.ytimg.com/vi/AfSk24UTFS8/default.jpg)
![Computational Complexity Theory in a Nutshell](https://i.ytimg.com/vi/PULdx0MBWoY/default.jpg)
![P vs. NP and the Computational Complexity Zoo](https://i.ytimg.com/vi/YX40hbAHx3s/default.jpg)
![Lec 1 | MIT 6.042J Mathematics for Computer Science, Fall 2010](https://i.ytimg.com/vi/L3LMbpZIKhQ/default.jpg)
![8. Hashing with Chaining](https://i.ytimg.com/vi/0M_kIqhwbFo/default.jpg)
![24. Topics in Algorithms Research](https://i.ytimg.com/vi/dU40AvBURDQ/default.jpg)
![10. Understanding Program Efficiency, Part 1](https://i.ytimg.com/vi/o9nW0uBqvEo/default.jpg)
![21. DP III: Parenthesization, Edit Distance, Knapsack](https://i.ytimg.com/vi/ocZMDMZwhCY/default.jpg)
![This is the BOMB to worry about](https://i.ytimg.com/vi/ZfXQeP6ESnE/default.jpg)
![7. Counting Sort, Radix Sort, Lower Bounds for Sorting](https://i.ytimg.com/vi/Nz1KZXbghj8/default.jpg)
![What is complexity theory? (P vs. NP explained visually)](https://i.ytimg.com/vi/u2DLlNQiPB4/default.jpg)
![11. Dynamic Programming: All-Pairs Shortest Paths](https://i.ytimg.com/vi/NzgFUwOaoIw/default.jpg)
![Self Taught Programmers... Listen Up.](https://i.ytimg.com/vi/FrFY6Y1MJBQ/default.jpg)
![13. Breadth-First Search (BFS)](https://i.ytimg.com/vi/s-CYnVz-uh4/default.jpg)