.. What I'm going to do now-- let's start out with the case where-- now it's going to get a little bit more complicated if we drop the independence assumption.

我现在要做的是-,让我们从案例开始-,接下来的情况会比刚才的复杂一点,因为我们去掉了“相互独立“这一前提假设。

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

It is certainly possible, for example, that a quadratic algorithm could run faster than a linear algorithm. It depends on what the input is, it depends on, you know, what the particular cases are. So it is not the case that, on every input, a linear algorithm is always going to be better than a quadratic algorithm.

一个二次平方级复杂度的算法,当然也是可能跑的比线性复杂度算法快的,这取决于，你知道的，输入以及特定的案例，因此并不是对于每个输入,线性复杂度就一定会,比二次平方级复杂度的算法的表现要好,只是通常来说是这样的。

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

Well,hard cases there.

这就是很复杂的案例了。

耶鲁公开课 - 死亡课程节选

Just to see that in a very simple example, again, we don't use such a complicated example as the one we looked at last time, you could imagine a game, a really trivial coordination game, which looked like this .

不妨再举一个例子,我们就不找上一讲那么复杂的案例了,看一下这个简单的协调博弈,如

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