Question

What does it mean by "f is dominated by g asymptotically" for f(n)=o(g(n))?

score 858 · Answer 1 · 2019-02-24 22:18:29

858

Views

What does it mean by "f is dominated by g asymptotically" for f(n)=o(g(n))?

Published on 24 Feb 2019 - 22:18

score 46 · Answer 2 · 2026-03-27 12:01:12

46

Views

How to interpret arrow pointing away from function declaration?

Published on 27 Mar 2026 - 12:01

score 181 · Answer 3 · 2019-02-27 02:51:35

181

Views

Prove whether $f(n)$ is $O$, $o$, $\Omega$, $\omega$ or $\Theta$ of $g(n)$ for given $f$ and $g$

Published on 27 Feb 2019 - 2:51

score 292 · Answer 4 · 2026-03-27 13:48:17

292

Views

Compute the worst case time complexity of the following algorithm, for i = 1 to n do for j = 1 to n do for k = 1 to i + j do print (i, j, k).

Published on 27 Mar 2026 - 13:48

score 22 · Answer 5 · 2026-03-26 09:45:09

22

Views

Iterative Homing Function

Published on 26 Mar 2026 - 9:45

score 42 · Answer 6 · 2026-03-25 13:51:06

42

Views

Ordered Sets and Lattices

Published on 25 Mar 2026 - 13:51

score 62 · Answer 7 · 2026-03-25 12:13:13

62

Views

Positioning arrow labels using linear algebra.

Published on 25 Mar 2026 - 12:13

score 46 · Answer 8 · 2026-03-28 07:35:00

46

Views

Simplify boolean expression, so close but yet so far

Published on 28 Mar 2026 - 7:35

score 174 · Answer 9 · 2026-03-25 07:41:40

174

Views

Can we see all mathematical concepts as (possibly uncountable-time) algorithms?

Published on 25 Mar 2026 - 7:41

score 57 · Answer 10 · 2026-03-26 01:06:42

57

Views

Non automatic structure, which is decidable

Published on 26 Mar 2026 - 1:06

score 27 · Answer 11 · 2026-03-27 12:27:33

27

Views

Find the smallest set of strings which "covers" a given set of strings (coverage = containing as substring)

Published on 27 Mar 2026 - 12:27

score 37 · Answer 12 · 2019-03-04 12:26:32

37

Views

Evaluate $\prod_{k=1}^{n} \sum_{i\ =1}^{k} a_i$ in $\mathcal{O}(n)$

Published on 04 Mar 2019 - 12:26

score 62 · Answer 13 · 2026-03-25 14:47:05

62

Views

Probability of a inverse exp random variable larger than sum of inverse exp random variables

Published on 25 Mar 2026 - 14:47

score 21.6k · Answer 14 · 2019-03-05 05:23:20

21.6k

Views

Is there a math expression equivalent to the conditional ternary operator?

Published on 05 Mar 2019 - 5:23

score 182 · Answer 15 · 2026-03-25 07:42:14

182

Views

Field with one element and Chaitin's Constant

Published on 25 Mar 2026 - 7:42

List Question

What does it mean by "f is dominated by g asymptotically" for f(n)=o(g(n))?

How to interpret arrow pointing away from function declaration?

Prove whether $f(n)$ is $O$, $o$, $\Omega$, $\omega$ or $\Theta$ of $g(n)$ for given $f$ and $g$

Compute the worst case time complexity of the following algorithm, for i = 1 to n do for j = 1 to n do for k = 1 to i + j do print (i, j, k).

Iterative Homing Function

Ordered Sets and Lattices

Positioning arrow labels using linear algebra.

Simplify boolean expression, so close but yet so far

Can we see all mathematical concepts as (possibly uncountable-time) algorithms?

Non automatic structure, which is decidable

Find the smallest set of strings which "covers" a given set of strings (coverage = containing as substring)

Evaluate $\prod_{k=1}^{n} \sum_{i\ =1}^{k} a_i$ in $\mathcal{O}(n)$

Probability of a inverse exp random variable larger than sum of inverse exp random variables

Is there a math expression equivalent to the conditional ternary operator?

Field with one element and Chaitin's Constant

Trending Questions

Popular # Hahtags

Popular Questions