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-N…
Video Rating: 5 / 5

13 Replies to “23. Computational Complexity”

  1. Thanks Erik … it was a refreshing lesson … but …. we don’t live in a 3-D world … actually the real world is not 3-D … having said that here is a problem I would like to know the complexity for: Given a vector space and a finite set of points I want know the “best” metric for the shortest path. “Best” = “takes the optimal resources for computation”. Imagine of course that the “real world” can be reduced to a vector space.

Leave a Reply