Question

$T(n)=n\sqrt{n}T(\sqrt{n})+n^3\log^2{(n\log{(\log{n})})}$

score 64 · Answer 1 · 2020-07-19 12:52:00

64

Views

$T(n)=n\sqrt{n}T(\sqrt{n})+n^3\log^2{(n\log{(\log{n})})}$

Published on 19 Jul 2020 - 12:52

score 312 · Answer 2 · 2020-07-21 13:11:40

312

Views

Inapproximability of the $k$-center problem

Published on 21 Jul 2020 - 13:11

score 1k · Answer 3 · 2020-07-22 07:27:28

1k

Views

MIN-FORMULA $\in$ NP

Published on 22 Jul 2020 - 7:27

score 28 · Answer 4 · 2020-07-24 07:35:06

28

Views

find $f(n)$ that isn't little $o(n^2)$ and isn't $w(n)$

Published on 24 Jul 2020 - 7:35

score 84 · Answer 5 · 2020-07-24 22:44:48

84

Views

Can $a \bmod 3$ be represented arithmetically without the mod or other integer-related functions?

Published on 24 Jul 2020 - 22:44

score 20 · Answer 6 · 2020-07-25 11:51:06

20

Views

How to estimate the number of loop given that the inner loop index always greater than outer loop for Big O complexity estimation?

Published on 25 Jul 2020 - 11:51

score 532 · Answer 7 · 2020-07-28 04:57:27

532

Views

Computational Complexity of $\log(\log^{}(n)) = \Omega(\log^{}(\log (n)))$

Published on 28 Jul 2020 - 4:57

score 37 · Answer 8 · 2026-03-26 16:06:26

37

Views

For What Families of Subgraphs, the Subgraph Isomorphism Problem Can be Solved in Polynomial Time?

Published on 26 Mar 2026 - 16:06

score 48 · Answer 9 · 2016-07-08 10:26:33

48

Views

Hardness for problems with non constant input parameters.

Published on 08 Jul 2016 - 10:26

score 43 · Answer 10 · 2026-03-26 15:16:59

43

Views

Is $\{\langle M \rangle \mid \exists P \;\text{(p is polynom)}\; \forall w\; \text{M(w) halt with less than p(|w|) steps}\} \in RE$?

Published on 26 Mar 2026 - 15:16

score 22 · Answer 11 · 2016-07-13 02:09:23

22

Views

Is there a simple way to describe all $O(n)$ algorithms given simple assumptions about the machine?

Published on 13 Jul 2016 - 2:09

score 316 · Answer 12 · 2026-03-28 05:21:53

316

Views

Analysis of bisection search

Published on 28 Mar 2026 - 5:21

score 38 · Answer 13 · 2026-03-30 16:30:04

38

Views

When is $\frac{2 n f(n)}{n !}$ in the order of some fixed power of $n$?

Published on 30 Mar 2026 - 16:30

score 121 · Answer 14 · 2026-03-26 04:53:19

121

Views

Find solutions of $a + b + c$ even, $3a + 2b - 3c$ odd, $a - 7b + 8c$ odd, in polynomial time

Published on 26 Mar 2026 - 4:53

score 973 · Answer 15 · 2016-07-17 08:57:50

973

Views

Bin packing approximation algorithm

Published on 17 Jul 2016 - 8:57

List Question

$T(n)=n\sqrt{n}T(\sqrt{n})+n^3\log^2{(n\log{(\log{n})})}$

Inapproximability of the $k$-center problem

MIN-FORMULA $\in$ NP

find $f(n)$ that isn't little $o(n^2)$ and isn't $w(n)$

Can $a \bmod 3$ be represented arithmetically without the mod or other integer-related functions?

How to estimate the number of loop given that the inner loop index always greater than outer loop for Big O complexity estimation?

Computational Complexity of $\log(\log^{}(n)) = \Omega(\log^{}(\log (n)))$

For What Families of Subgraphs, the Subgraph Isomorphism Problem Can be Solved in Polynomial Time?

Hardness for problems with non constant input parameters.

Is $\{\langle M \rangle \mid \exists P \;\text{(p is polynom)}\; \forall w\; \text{M(w) halt with less than p(|w|) steps}\} \in RE$?

Is there a simple way to describe all $O(n)$ algorithms given simple assumptions about the machine?

Analysis of bisection search

When is $\frac{2 n f(n)}{n !}$ in the order of some fixed power of $n$?

Find solutions of $a + b + c$ even, $3a + 2b - 3c$ odd, $a - 7b + 8c$ odd, in polynomial time

Bin packing approximation algorithm

Trending Questions

Popular # Hahtags

Popular Questions