日本の
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
完全な記事
カテゴリ
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
あなたが書く
ユーザー
ログイン
登録
パスワードの復元
タグ
言語タグ
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
タグlandau-notation - これはページ1です - GeneraCodice
関数$ f $が存在します。
https://www.generacodice.com/jp/articolo/2476606/関数-f-が存在します
asymptotics
-
landau-notation
cs.stackexchange
なぜ$ \ sum_2 ^ 2I \ GEQ \ OMEGA(n \ sqrt {n} \ log_2n)$ですか?
https://www.generacodice.com/jp/articolo/2474020/なぜ-sum-2-2i-geq-omega-n-sqrt-n-log-2n-ですか
landau-notation
-
runtime-analysis
cs.stackexchange
$ o(\ text {max} \}} {f(n)、g(n)})= O(f(n)+ g(n))$を示す
https://www.generacodice.com/jp/articolo/2469009/-o-text-max-f-n-g-n-o-f-n-g-n-を示す
asymptotics
-
landau-notation
cs.stackexchange
$ 3X ^ 3 + 2X + 1 $が$ \ omω(x \ cdot \ log x)$です。
https://www.generacodice.com/jp/articolo/2465826/-3x-3-2x-1-が-omω-x-cdot-log-x-です
complexity-theory
-
asymptotics
-
landau-notation
-
proof-techniques
-
complexity-classes
cs.stackexchange
総額を含む関数の漸近増殖
https://www.generacodice.com/jp/articolo/2451038/総額を含む関数の漸近増殖
time-complexity
-
landau-notation
-
big-o-notation
cs.stackexchange
How do I simplify $O\left({n^2}/{\log{\frac{n(n+1)}{2}}}\right)$
https://www.generacodice.com/jp/articolo/2447349/how-do-i-simplify-o-left-n-2-log-frac-n-n-1-2-right
asymptotics
-
landau-notation
-
big-o-notation
cs.stackexchange
Substitution for Landau's O notation formula
https://www.generacodice.com/jp/articolo/1613045/substitution-for-landau-s-o-notation-formula
complexity-theory
-
landau-notation
cs.stackexchange
If my algorithm has complexity O(n!*n), can I just write O(n!), or do I have to keep it like O(n!*n)?
https://www.generacodice.com/jp/articolo/1610786/if-my-algorithm-has-complexity-o-n-n-can-i-just-write-o-n-or-do-i-have-to-keep-it-like-o-n-n
asymptotics
-
landau-notation
cs.stackexchange
Proving Big Omega of a polynomial without limits
https://www.generacodice.com/jp/articolo/1610000/proving-big-omega-of-a-polynomial-without-limits
asymptotics
-
landau-notation
cs.stackexchange
What is wrong with this solution for $\mathcal{O}({\log({n \choose \frac{n}{2}})})$?
https://www.generacodice.com/jp/articolo/1609883/what-is-wrong-with-this-solution-for-mathcal-o-log-n-choose-frac-n-2
complexity-theory
-
asymptotics
-
landau-notation
cs.stackexchange
«
1
2
3
4
5
6
»
結果が見つかりました: 247