Re:Haskell Researchers Announce Discovery of Industry Progra...
by csantini on Wednesday December 01, 2010 @05:40PM
(#1960050)
"Finding a person who gives a shit about Haskell is an inherently NP-complete computer science problem. It's similar in scope and complexity to the problem of trying to find a tenured academic who didn't have the bulk of his or her work done by uncredited graduate students."
[ Parent
| on HN ]
Re:Haskell Researchers Announce Discovery of Industry Progra...
by prosa on Wednesday December 01, 2010 @07:27PM
(#1960401)
Surely you could implement this search in at least O(n) time?
Re:Haskell Researchers Announce Discovery of Industry Progra...
by aperiodic on Wednesday December 01, 2010 @10:40PM
(#1960904)
That's assuming that you can verify whether or not any given person gives a shit about Haskell in O(1) time.
Re:Haskell Researchers Announce Discovery of Industry Progra...
by eru on Wednesday December 01, 2010 @08:59PM
(#1960673)
At least is easy. At most is hard.
Re:Haskell Researchers Announce Discovery of Industry Progra...
by wahnfrieden on Wednesday December 01, 2010 @10:03PM
(#1960818)
"At least, if not better." The context disambiguates the direction of magnitude.