Etiqueta big-o-notation - Esta es la página 10 - GeneraCodice

Improving time complexity from O(log n/loglog n) to O((log ((nloglog n)/log n))/loglog ((nloglog n)/log n))

https://www.generacodice.com/es/articolo/2447371/improving-time-complexity-from-o-log-n-loglog-n-to-o-log-nloglog-n-log-n-loglog-nloglog-n-log-n
  time-complexity  -  algorithms  -  big-o-notation
cs.stackexchange cs.stackexchange

How do I simplify $O\left({n^2}/{\log{\frac{n(n+1)}{2}}}\right)$

https://www.generacodice.com/es/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 cs.stackexchange

La comprensión de BIG-O mejoró masivamente cuando comencé a pensar en pedidos como sets.¿Cómo aplicar el mismo enfoque de BIG-THETA?

https://www.generacodice.com/es/articolo/2445365/la-comprension-de-big-o-mejoro-masivamente-cuando-comence-a-pensar-en-pedidos-como-sets-como-aplicar-el-mismo-enfoque-de-big-theta
  time-complexity  -  asymptotics  -  big-o-notation
cs.stackexchange cs.stackexchange

Notación Big-O para la función dada cuya complejidad en tiempo de ejecución crece más rápido que la entrada

https://www.generacodice.com/es/articolo/2442856/notacion-big-o-para-la-funcion-dada-cuya-complejidad-en-tiempo-de-ejecucion-crece-mas-rapido-que-la-entrada
  asymptotics  -  big-o-notation
cs.stackexchange cs.stackexchange

Asymptotics of $\frac{1}{\log(\frac{2^n}{2^n-1})}$

https://www.generacodice.com/es/articolo/1810167/asymptotics-of-frac-1-log-frac-2-n-2-n-1
  asymptotics  -  big-o-notation
cs.stackexchange cs.stackexchange

How to determine time complexity with a simple way?

https://www.generacodice.com/es/articolo/1809005/how-to-determine-time-complexity-with-a-simple-way
  asymptotics  -  big-o-notation
cs.stackexchange cs.stackexchange

Combining Predicate Logic and BigO

https://www.generacodice.com/es/articolo/1621980/combining-predicate-logic-and-bigo
  logic  -  first-order-logic  -  algorithms  -  predicate-logic  -  big-o-notation
cs.stackexchange cs.stackexchange

Is log(n) equivalent to (log(n))^x for big-O analysis?

https://www.generacodice.com/es/articolo/1621941/is-log-n-equivalent-to-log-n-x-for-big-o-analysis
  asymptotics  -  runtime-analysis  -  big-o-notation
cs.stackexchange cs.stackexchange

Why is building a heap $\mathcal O(n)$ and not $\theta(n)$?

https://www.generacodice.com/es/articolo/1621377/why-is-building-a-heap-mathcal-o-n-and-not-theta-n
  asymptotics  -  heaps  -  big-o-notation
cs.stackexchange cs.stackexchange

Prove or disprove that $log^{k}(n) \in O(\sqrt{n}) \forall k > 0$

https://www.generacodice.com/es/articolo/1620912/prove-or-disprove-that-log-k-n-in-o-sqrt-n-forall-k-0
  complexity-theory  -  asymptotics  -  big-o-notation
cs.stackexchange cs.stackexchange
Resultados encontrados: 145
scroll top