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 master-theorem - This is page 8 - GeneraCodice
Solving recurrence relation where the $f(n)$ has some constant factor $k$ where $0 < k < 1$
https://www.generacodice.com/en/articolo/1616573/solving-recurrence-relation-where-the-f-n-has-some-constant-factor-k-where-0-k-1
master-theorem
-
recurrence-relation
cs.stackexchange
Could I apply the master theorem if my $N/b$ is $\varphi(N)$?
https://www.generacodice.com/en/articolo/1616339/could-i-apply-the-master-theorem-if-my-n-b-is-varphi-n
master-theorem
cs.stackexchange
Master theorem: When a $f(n)$ is smaller or larger than $n^{\log_b a}$by less than a polynomial factor
https://www.generacodice.com/en/articolo/1613868/master-theorem-when-a-f-n-is-smaller-or-larger-than-n-log-b-a-by-less-than-a-polynomial-factor
master-theorem
-
asymptotics
cs.stackexchange
Solving using the master theorem: T(n)=T(n/2)+n⋅log n and T(n)=T(n/8)+2.n [closed]
https://www.generacodice.com/en/articolo/1612799/solving-using-the-master-theorem-t-n-t-n-2-n-log-n-and-t-n-t-n-8-2-n-closed
master-theorem
-
algorithms
cs.stackexchange
Formulating the master theorem with Little-O- and Little-Omega notation
https://www.generacodice.com/en/articolo/1612541/formulating-the-master-theorem-with-little-o-and-little-omega-notation
time-complexity
-
master-theorem
-
algorithms
-
asymptotics
cs.stackexchange
Meaning of polynomially larger or smaller in the context of the master method
https://www.generacodice.com/en/articolo/1609206/meaning-of-polynomially-larger-or-smaller-in-the-context-of-the-master-method
master-theorem
-
polynomials
-
asymptotics
cs.stackexchange
Merge sort: sorting and merging complexity $\Theta(n)$
https://www.generacodice.com/en/articolo/1608676/merge-sort-sorting-and-merging-complexity-theta-n
mergesort
-
time-complexity
-
master-theorem
-
algorithms
cs.stackexchange
$f(n) = o(n^c) \rightarrow \exists \epsilon > 0 \ s.t. f(n) = O(n^{c-\epsilon})$
https://www.generacodice.com/en/articolo/1607762/f-n-o-n-c-rightarrow-exists-epsilon-0-s-t-f-n-o-n-c-epsilon
master-theorem
-
asymptotics
cs.stackexchange
Proof of the master thorem case with floors and b = 2
https://www.generacodice.com/en/articolo/1607044/proof-of-the-master-thorem-case-with-floors-and-b-2
master-theorem
-
algorithm-analysis
cs.stackexchange
Missing part of the proof of Master Theorem's case 2 (with ceilings and floors) in CLRS?
https://www.generacodice.com/en/articolo/1606250/missing-part-of-the-proof-of-master-theorem-s-case-2-with-ceilings-and-floors-in-clrs
master-theorem
-
asymptotics
cs.stackexchange
«
5
6
7
8
9
10
»
Results found: 180