标签asymptotics - 这是页1 - GeneraCodice

Asymptotic runtime of recursive algorithm uisng subsitution method

https://www.generacodice.com/cn/articolo/2479849/asymptotic-runtime-of-recursive-algorithm-uisng-subsitution-method
  recursion  -  algorithms  -  asymptotics  -  algorithm-analysis
cs.stackexchange cs.stackexchange

Is it true that $f(n) = c\cdot g(n) + O(g(n))$ implies $f(n) = O(g(n))$?

https://www.generacodice.com/cn/articolo/2479612/is-it-true-that-f-n-c-cdot-g-n-o-g-n-implies-f-n-o-g-n
  time-complexity  -  asymptotics  -  big-o-notation
cs.stackexchange cs.stackexchange

If a function $f(n)=\Theta(g(n))$, does it follow that $f(n/k)=\Theta(g(n))$ for a constant $k$?

https://www.generacodice.com/cn/articolo/2479370/if-a-function-f-n-theta-g-n-does-it-follow-that-f-n-k-theta-g-n-for-a-constant-k
  complexity-theory  -  asymptotics
cs.stackexchange cs.stackexchange

以替换方法选择常量方法$ t（n）= 5t（n / 4）+ n ^ 2 $

https://www.generacodice.com/cn/articolo/2478517/以替换方法选择常量方法-t-n-5t-n-4-n-2
  time-complexity  -  asymptotics  -  recurrence-relation
cs.stackexchange cs.stackexchange

数组双循环中对的时间复杂度

https://www.generacodice.com/cn/articolo/2478435/数组双循环中对的时间复杂度
  time-complexity  -  asymptotics  -  big-o-notation
cs.stackexchange cs.stackexchange

为什么学习复杂性理论？

https://www.generacodice.com/cn/articolo/2477987/为什么学习复杂性理论
  complexity-theory  -  asymptotics
cs.stackexchange cs.stackexchange

如何证明ln（n）=θ（log2 n）？

https://www.generacodice.com/cn/articolo/2477170/如何证明ln-n-θ-log2-n
  asymptotics  -  algorithm-analysis
cs.stackexchange cs.stackexchange

是否存在函数$ f $，这样：$ f（n-k）\ ne \ theta（f（n））$ for for soming ancor $ k \ geq1 $？

https://www.generacodice.com/cn/articolo/2476606/是否存在函数-f-这样-f-n-k-ne-theta-f-n-for-for-soming-ancor-k-geq1
  asymptotics  -  landau-notation
cs.stackexchange cs.stackexchange

解决两个变量的异常再次发生

https://www.generacodice.com/cn/articolo/2476498/解决两个变量的异常再次发生
  asymptotics  -  recurrence-relation  -  big-o-notation
cs.stackexchange cs.stackexchange

如何用两个单独的收敛速度解决递归

https://www.generacodice.com/cn/articolo/2473527/如何用两个单独的收敛速度解决递归
  recursion  -  asymptotics  -  big-o-notation
cs.stackexchange cs.stackexchange
发现结果: 1089
scroll top