Question

How do we solve the recurrence $T(n) = 2T(n/3) + n^{ \log_32 }\log\log n$?

score 134 · Answer 1 · 2022-04-23 12:34:34

134

Views

How do we solve the recurrence $T(n) = 2T(n/3) + n^{ \log_32 }\log\log n$?

Published on 23 Apr 2022 - 12:34

score 147 · Answer 2 · 2022-05-05 12:00:43

147

Views

How do you calculate the best/worst case complexity of an algorithm?

Published on 05 May 2022 - 12:00

score 94 · Answer 3 · 2022-05-12 06:27:32

94

Views

Algorithm complexity: Proof that $\lfloor\sqrt{n}\rfloor \geq \frac{\sqrt{n}}{2}$ and $n-\lfloor\sqrt{n}\rfloor+1\geq \frac{n}{2}$, $\forall n\geq 2$

Published on 12 May 2022 - 6:27

score 57 · Answer 4 · 2022-05-16 07:35:00

57

Views

In TSP where a modified triangle inequality holds, what is the approximation ratio of Christofides' algorithm?

Published on 16 May 2022 - 7:35

score 156 · Answer 5 · 2022-05-16 20:13:38

156

Views

No Dijkstra and no BFS? What else is there?

Published on 16 May 2022 - 20:13

score 30 · Answer 6 · 2022-05-29 06:34:10

30

Views

Show that $ O((8k)!^4 \cdot\mathrm{poly}(n))=e^ { O ( \sqrt n \cdot \log n ) } $ given $ k = O( \sqrt n ) $

Published on 29 May 2022 - 6:34

score 128 · Answer 7 · 2022-05-30 12:49:10

128

Views

Computational cost/complexity of algorithms based on the number of mathematical operations

Published on 30 May 2022 - 12:49

score 49 · Answer 8 · 2022-06-05 17:01:43

49

Views

Justifying that ISOLATED problem belongs to SPACE(log n)

Published on 05 Jun 2022 - 17:01

score 34 · Answer 9 · 2022-06-06 05:43:08

34

Views

NP problem in $\mathit{TIME}(f(n))$

Published on 06 Jun 2022 - 5:43

score 64 · Answer 10 · 2026-02-24 06:47:02

64

Views

Scalar "Triangle Inequality" for Logarithms

Published on 24 Feb 2026 - 6:47

score 45 · Answer 11 · 2022-06-11 21:27:26

45

Views

Amortized analysis of append with non-constant growth factor

Published on 11 Jun 2022 - 21:27

score 30 · Answer 12 · 2022-06-16 08:39:05

30

Views

Resources for a simple introduction to computational complexity

Published on 16 Jun 2022 - 8:39

score 30 · Answer 13 · 2022-07-05 12:50:12

30

Views

How to call the property that says that a heuristic is able to find the optimal solution?

Published on 05 Jul 2022 - 12:50

score 36 · Answer 14 · 2022-08-04 14:29:14

36

Views

Is the sequence produced by this algorithm decaying as $\frac{c}{\sqrt{t-t_0}}$?

Published on 04 Aug 2022 - 14:29

score 27 · Answer 15 · 2022-08-10 16:28:29

27

Views

What's the relation between these two definition of Ackermann function?

Published on 10 Aug 2022 - 16:28

List Question

How do we solve the recurrence $T(n) = 2T(n/3) + n^{ \log_32 }\log\log n$?

How do you calculate the best/worst case complexity of an algorithm?

Algorithm complexity: Proof that $\lfloor\sqrt{n}\rfloor \geq \frac{\sqrt{n}}{2}$ and $n-\lfloor\sqrt{n}\rfloor+1\geq \frac{n}{2}$, $\forall n\geq 2$

In TSP where a modified triangle inequality holds, what is the approximation ratio of Christofides' algorithm?

No Dijkstra and no BFS? What else is there?

Show that $ O((8k)!^4 \cdot\mathrm{poly}(n))=e^ { O ( \sqrt n \cdot \log n ) } $ given $ k = O( \sqrt n ) $

Computational cost/complexity of algorithms based on the number of mathematical operations

Justifying that ISOLATED problem belongs to SPACE(log n)

NP problem in $\mathit{TIME}(f(n))$

Scalar "Triangle Inequality" for Logarithms

Amortized analysis of append with non-constant growth factor

Resources for a simple introduction to computational complexity

How to call the property that says that a heuristic is able to find the optimal solution?

Is the sequence produced by this algorithm decaying as $\frac{c}{\sqrt{t-t_0}}$?

What's the relation between these two definition of Ackermann function?

Trending Questions

Popular # Hahtags

Popular Questions