en
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Full articles
Categories
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
You write
User
Login
Registration
Password recovery
Tags
Language tags
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag landau-notation - This is page 1 - GeneraCodice
Does a function $f$ exists such that: $f(n-k) \ne \Theta(f(n))$ for some constant $k\geq1$?
https://www.generacodice.com/en/articolo/2476606/does-a-function-f-exists-such-that-f-n-k-ne-theta-f-n-for-some-constant-k-geq1
asymptotics
-
landau-notation
cs.stackexchange
Why is $\sum_{i=0}^n\sqrt{i}\log_2^2i \geq \Omega(n\sqrt{n}\log_2n)$?
https://www.generacodice.com/en/articolo/2474020/why-is-sum-i-0-n-sqrt-i-log-2-2i-geq-omega-n-sqrt-n-log-2n
landau-notation
-
runtime-analysis
cs.stackexchange
Show that $O(\text{max}\{f(n),g(n)\})=O(f(n)+g(n))$
https://www.generacodice.com/en/articolo/2469009/show-that-o-text-max-f-n-g-n-o-f-n-g-n
asymptotics
-
landau-notation
cs.stackexchange
How do I prove that $3x^3 +2x + 1 $ is $\omega(x \cdot \log x) $
https://www.generacodice.com/en/articolo/2465826/how-do-i-prove-that-3x-3-2x-1-is-omega-x-cdot-log-x
complexity-theory
-
asymptotics
-
landau-notation
-
proof-techniques
-
complexity-classes
cs.stackexchange
Asymptotic growth of a function containing a sum
https://www.generacodice.com/en/articolo/2451038/asymptotic-growth-of-a-function-containing-a-sum
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/en/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/en/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/en/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/en/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/en/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
»
Results found: 247