Typically up till now, we've looked at things that can be done in sublinear time. Or, at worst, polynomial time. We'll now look at a problem that does not fall into that. And we'll start with what's called the continuous knapsack problem.

至今为止我们已经处理过,亚线性问题，最多也就是多项式问题,我们现在要看的问题则是不能用这些解决的,我们将要开始讲连续背包问题。

麻省理工公开课 - 计算机科学及编程导论课程节选

And I'll also remind you, and we're going to see this in the next example, we talked about looking at the worst case behavior. In these cases there's no best case worst case, it's just doing one computation.

我还要提醒大家的就是，我们也会在下一个例子里发现者一点，我们谈到了要去考虑最坏的情况,在下面这些例子里,没有好情况坏情况之分，就只是一次运算。

麻省理工公开课 - 计算机科学及编程导论课程节选

So the gentleman here was looking at the worst case scenario, and the woman here was looking at the best case scenario.

刚才的小伙子看的是最坏的情况,而这位女士看的是最好的情况

耶鲁公开课 - 博弈论课程节选

It is at its worst after retirement ... when you are no longer-- you've exhausted your human capital and you're living off of all the accumulated physical capital.

退休后，到达顶峰,当你不再-,你用尽了你的人力资本,只能以之前积累下来的,有形资本为生。

耶鲁公开课 - 金融市场课程节选