Having already taken CS 252, Theory of Computation, I've already had a decent exposure to P and NP problems. It's actually a shame we won't be going over Turing machines, as I really enjoyed them at the time. This is the aspect of algorithms that has always fascinated me more than anything else; it's incredible to think there are NP problems that we don't even know could be in P!
As for my concerns, I know that proofs around these types of algorithms are much less intuitive (at least they have been for me), and I hope the course will help us develop the intuition for them.
No comments:
Post a Comment