한국어
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
태그 big-o-notation - 이것은 페이지 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/ko/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
How do I simplify $O\left({n^2}/{\log{\frac{n(n+1)}{2}}}\right)$
https://www.generacodice.com/ko/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
세트로서 명령을 생각하기 시작했을 때 BIG-O의 이해가 크게 향상되었습니다.Big-Theta에 동일한 접근 방식을 적용하는 방법은 무엇입니까?
https://www.generacodice.com/ko/articolo/2445365/세트로서-명령을-생각하기-시작했을-때-big-o의-이해가-크게-향상되었습니다-big-theta에-동일한-접근-방식을-적용하는-방법은-무엇입니까
time-complexity
-
asymptotics
-
big-o-notation
cs.stackexchange
Big-O 표기에 대한 지정된 기능의 복잡한 런타임 성장보다 더 빠르게 입력
https://www.generacodice.com/ko/articolo/2442856/big-o-표기에-대한-지정된-기능의-복잡한-런타임-성장보다-더-빠르게-입력
asymptotics
-
big-o-notation
cs.stackexchange
Asymptotics of $\frac{1}{\log(\frac{2^n}{2^n-1})}$
https://www.generacodice.com/ko/articolo/1810167/asymptotics-of-frac-1-log-frac-2-n-2-n-1
asymptotics
-
big-o-notation
cs.stackexchange
How to determine time complexity with a simple way?
https://www.generacodice.com/ko/articolo/1809005/how-to-determine-time-complexity-with-a-simple-way
asymptotics
-
big-o-notation
cs.stackexchange
Combining Predicate Logic and BigO
https://www.generacodice.com/ko/articolo/1621980/combining-predicate-logic-and-bigo
logic
-
first-order-logic
-
algorithms
-
predicate-logic
-
big-o-notation
cs.stackexchange
Is log(n) equivalent to (log(n))^x for big-O analysis?
https://www.generacodice.com/ko/articolo/1621941/is-log-n-equivalent-to-log-n-x-for-big-o-analysis
asymptotics
-
runtime-analysis
-
big-o-notation
cs.stackexchange
Why is building a heap $\mathcal O(n)$ and not $\theta(n)$?
https://www.generacodice.com/ko/articolo/1621377/why-is-building-a-heap-mathcal-o-n-and-not-theta-n
asymptotics
-
heaps
-
big-o-notation
cs.stackexchange
Prove or disprove that $log^{k}(n) \in O(\sqrt{n}) \forall k > 0$
https://www.generacodice.com/ko/articolo/1620912/prove-or-disprove-that-log-k-n-in-o-sqrt-n-forall-k-0
complexity-theory
-
asymptotics
-
big-o-notation
cs.stackexchange
«
7
8
9
10
11
12
»
결과가 발견되었습니다: 145