I was reading one of my favorite blogs this morning and Jeff was talking about NP-complete problems which are basically the ones that no fast solutions to them is known. They are "solve-able" but the time required to do that can be years... Hmmm, that sounds so familiar :) My job hunting is becoming more and more like an NP-complete problem lately. I am trying different algorithms to make the time shorter but it seems like every time I try harder I get a longer waiting period.
It's time to come up with an approximation algorithm to finally solve this NP-complete problem for good.
No comments:
Post a Comment