3 ms·
"hard" in this case doesn't mean complexity, it means difficulty in an emotional sense
by darkwizard42 3y ago
"hard" in this case doesn't mean complexity, it means difficulty in an emotional sense
- Panini_Jones 3y ago"We’ve solved the NP-hard decision problem of reducing the size of our recruiting team in polynomial time, thus proving P=NP."
- WJW 3y agoSurely firing N people is at most linear time. Possibly lower, if you can get economies of scale by caching the paperwork.
- Panini_Jones 3y agoApologies; I wasn't very serious in my previous comment. I'm not sure how layoff algorithms work, but it is most likely polynomial. Firing people would be linear/sub-linear but candidate selection is probably a bit heavier. Maybe a little extra overhead too for paying MBB to suggest Google's GRAD and SCI programs.
- version_five 3y agoO(1) for that guy that just fired everyone during a zoom meeting.