computational complexity

基本解釋

And that is a preface to an idea of computational complexity we're going to come back to.
這是我們日后,要講的計算復雜度的,一個前言。
Big-O notation: Computational complexity theory uses big-O notation to describe how input-data size affects an algorithm's use of computational resources.
Big-O notation：計算復雜性理論使用大 0 符號描述輸入數(shù)據(jù)大小如何影響計算資源對算法的使用。
Calculations of computational complexity seem to be one of the harder subjects for students; there's no doubt of their value, though, when they lead to such speedups.
對于學生來說，計算“計算復雜度”似乎是較難的課題之一；但是當這些方法產生這樣的加速時，它們的價值無庸置疑。

And that is a preface to an idea of computational complexity we're going to come back to.
這是我們日后,要講的計算復雜度的,一個前言。
麻省理工公開課 - 計算機科學及編程導論課程節(jié)選
That's an important observation, and as we get to the part of the course we talk about computational complexity, you'll see that what we really care about is not how efficient the program is on easy problems but how efficient it is on hard problems.
我們已經學習了這門課程的一部分了，我們要開始認識到,計算的復雜度這個概念，你會學習到我們在乎的并不是,算法在簡單問題上的工作效率,而是解決復雜問題的效率。
麻省理工公開課 - 計算機科學及編程導論課程節(jié)選

These technology wizardries are achieved by requiring many more times the computational complexity.
ENGADGET: ZiiLabs debuts '100-core' ZMS-40 processor optimized for Android 4.0, you can call it quad-core