<span class="searchmatch">time</span>-<span class="searchmatch">space</span> <span class="searchmatch">complexity</span> (usually uncountable, plural <span class="searchmatch">time</span>-<span class="searchmatch">space</span> <span class="searchmatch">complexities</span>) (computer science) The combination of the measure of the amount of <span class="searchmatch">time</span> and...
<span class="searchmatch">time</span>-<span class="searchmatch">space</span> <span class="searchmatch">complexities</span> plural of <span class="searchmatch">time</span>-<span class="searchmatch">space</span> <span class="searchmatch">complexity</span>...
to ignore constant terms and multiplication by constant terms. Coordinate terms: <span class="searchmatch">space</span> <span class="searchmatch">complexity</span>, <span class="searchmatch">time</span>-<span class="searchmatch">space</span> <span class="searchmatch">complexity</span> amount of <span class="searchmatch">time</span> big O notation...
on: <span class="searchmatch">space</span> <span class="searchmatch">complexity</span> Wikipedia <span class="searchmatch">space</span> <span class="searchmatch">complexity</span> (usually uncountable, plural <span class="searchmatch">space</span> <span class="searchmatch">complexities</span>) (computer science) A measure of the amount of <span class="searchmatch">space</span>, or...
irreducible <span class="searchmatch">complexity</span> Kolmogorov <span class="searchmatch">complexity</span> McCabe's <span class="searchmatch">complexity</span> overcomplexity Rademacher <span class="searchmatch">complexity</span> <span class="searchmatch">space</span> <span class="searchmatch">complexity</span> <span class="searchmatch">time</span> <span class="searchmatch">complexity</span> <span class="searchmatch">time</span>-<span class="searchmatch">space</span> <span class="searchmatch">complexity</span> ultracomplexity...
(kūkan, “<span class="searchmatch">space</span>”) + 計算量 (keisanryō, “computational <span class="searchmatch">complexity</span>”) 空(くう)間(かん)計(けい)算(さん)量(りょう) • (kūkankeisanryō) (computer science) <span class="searchmatch">space</span> <span class="searchmatch">complexity</span> 時間計算量(じかんけいさんりょう)...
computational resources—such as <span class="searchmatch">time</span> and <span class="searchmatch">space</span>—needed by the programs that solve the problems. The professor of <span class="searchmatch">complexity</span> theory says that the problem can...
(jikan, “<span class="searchmatch">time</span>”) + 計算量 (keisanryō, “computational <span class="searchmatch">complexity</span>”) 時(じ)間(かん)計(けい)算(さん)量(りょう) • (jikankeisanryō) (computer science) <span class="searchmatch">time</span> <span class="searchmatch">complexity</span> 空間計算量(くうかんけいさんりょう)...
parameter <span class="searchmatch">space</span> <span class="searchmatch">time</span>-<span class="searchmatch">space</span> <span class="searchmatch">time</span>-<span class="searchmatch">space</span> <span class="searchmatch">complexity</span> <span class="searchmatch">time</span>-<span class="searchmatch">space</span> compression <span class="searchmatch">time</span>-<span class="searchmatch">space</span> convergence <span class="searchmatch">time</span>-<span class="searchmatch">space</span> grid topological <span class="searchmatch">space</span> Traube's <span class="searchmatch">space</span> Triebel-Lizorkin...
vaativuus demandingness, challengingness (computing theory) <span class="searchmatch">complexity</span> (<span class="searchmatch">time</span> or <span class="searchmatch">space</span> <span class="searchmatch">complexity</span>) compounds vaativuusaste vaativuusluokitus “vaativuus”, in...