Question

find $f(n)$ for recurrence $T(n)=2T(\dfrac{n}{2})+\mathcal{O}(n\log{n})=\Theta(f(n))$

score 43 · Answer 1 · 2026-04-01 23:54:28

43

Views

find $f(n)$ for recurrence $T(n)=2T(\dfrac{n}{2})+\mathcal{O}(n\log{n})=\Theta(f(n))$

Published on 01 Apr 2026 - 23:54

score 63 · Answer 2 · 2023-10-25 13:22:37

63

Views

Complexity and logic question - natural numbers $c$ and $d$ such that $f(n) ≤ c · g(n) + d$ from $f ∈ O(g)$

Published on 25 Oct 2023 - 13:22

score 51 · Answer 3 · 2023-10-26 15:19:58

51

Views

Strassen factorization for $n \geq 3$

Published on 26 Oct 2023 - 15:19

score 64 · Answer 4 · 2026-03-27 07:18:49

64

Views

Union of complement of P and Q is in coNP

Published on 27 Mar 2026 - 7:18

score 34 · Answer 5 · 2023-10-28 01:45:16

34

Views

proving these assertions

Published on 28 Oct 2023 - 1:45

score 48 · Answer 6 · 2026-03-29 15:59:52

48

Views

Are these two definitions of one-way function equivalent?

Published on 29 Mar 2026 - 15:59

score 86 · Answer 7 · 2023-11-01 14:55:15

86

Views

Is there any time constructible function $f$ such that $f(n) = o(n\lg n)$ ？

Published on 01 Nov 2023 - 14:55

score 37 · Answer 8 · 2026-03-26 11:00:59

37

Views

What is the computational complexity of calculating determinants for matrices of finite precision floating-point numbers?

Published on 26 Mar 2026 - 11:00

score 70 · Answer 9 · 2023-11-01 21:36:32

70

Views

Give a lower bound of $T$ if $\log T / T \leq \epsilon^{2}$

Published on 01 Nov 2023 - 21:36

score 13 · Answer 10 · 2026-04-01 12:41:50

13

Views

How to find the time complexity of interpolation and addition?

Published on 01 Apr 2026 - 12:41

score 119 · Answer 11 · 2023-11-02 14:22:25

119

Views

Determining the Big O Order for a Non-Standard Recurrence Relation

Published on 02 Nov 2023 - 14:22

score 25 · Answer 12 · 2026-02-24 00:21:23

25

Views

Expected number of draws to get n equally likely outcomes m times each.

Published on 24 Feb 2026 - 0:21

score 39 · Answer 13 · 2026-03-30 11:15:10

39

Views

enumerating every computably infinitary sentence

Published on 30 Mar 2026 - 11:15

score 132 · Answer 14 · 2026-03-28 13:22:58

132

Views

What algorithm has the best runtime?

Published on 28 Mar 2026 - 13:22

score 51 · Answer 15 · 2023-11-06 08:59:46

A stronger way to solve $T\left ( n \right )= 2T\left ( n/4 \right )+ n^{1/2+ \epsilon}$ where $\epsilon= 0.01$, excluding the Master theorem

List Question

find $f(n)$ for recurrence $T(n)=2T(\dfrac{n}{2})+\mathcal{O}(n\log{n})=\Theta(f(n))$

Complexity and logic question - natural numbers $c$ and $d$ such that $f(n) ≤ c · g(n) + d$ from $f ∈ O(g)$

Strassen factorization for $n \geq 3$

Union of complement of P and Q is in coNP

proving these assertions

Are these two definitions of one-way function equivalent?

Is there any time constructible function $f$ such that $f(n) = o(n\lg n)$ ？

What is the computational complexity of calculating determinants for matrices of finite precision floating-point numbers?

Give a lower bound of $T$ if $\log T / T \leq \epsilon^{2}$

How to find the time complexity of interpolation and addition?

Determining the Big O Order for a Non-Standard Recurrence Relation

Expected number of draws to get n equally likely outcomes m times each.

enumerating every computably infinitary sentence

What algorithm has the best runtime?

A stronger way to solve $T\left ( n \right )= 2T\left ( n/4 \right )+ n^{1/2+ \epsilon}$ where $\epsilon= 0.01$, excluding the Master theorem

Trending Questions

Popular # Hahtags

Popular Questions