List questions from computational-complexity

Published on 11 Apr 2026 - 3:01

45

Views

What is the computational complexity of expression minimization over a distributive lattice?

Published on 11 Apr 2026 - 19:12

227

Views

Why write computational complexity as $O\left( m n \log (n^2 / m) \right)$?

Published on 29 Oct 2020 - 4:50

134

Views

Which complexity problem is this related to?

Published on 11 Apr 2026 - 4:11

81

Views

Computational complexity of graph operations

Published on 03 Apr 2026 - 1:31

2.2k

Views

$T(n)=4T(n/3)+n\log_2(n)$

Published on 02 Nov 2020 - 1:30

11.6k

Views

Complexity of matrix multiplication with different size

Published on 11 Apr 2026 - 2:10

42

Views

Truncate a sum in order to speed up an algorithm (Big O)

Published on 09 Apr 2026 - 15:22

89

Views

Why is $T(n)=2T\left(\frac{n}{2}\right) + n\log(n)$ time complexity is $Θ\big( n\log^2(n) \big) $?

Published on 04 Nov 2020 - 0:22

37

Views

Using matrices for a recurrence to compute $a_n$ in $O(\log n)$

Published on 03 Apr 2026 - 1:27

118

Views

overall complexity of additive algorithm

Published on 09 Apr 2026 - 17:22

50

Views

Is $\mathcal{O}(a^n) = \mathcal{O}(b^n)$ for $a,b > 1$?

Published on 05 Nov 2020 - 1:12

560

Views

Induction proof of $T(n)=T(\lfloor \alpha n \rfloor)+T(\lfloor(1−\alpha)n\rfloor)+1=O(n)$

Published on 07 Apr 2026 - 12:51

125

Views

Efficient Evaluation of the Expression

Published on 11 Apr 2026 - 14:36

24

Views

A machine can compare at most three integers in one run. Show that at least $k(n) := \lceil log_6(n!) \rceil$ runs are needed to sort $n$ integers.

Published on 27 Mar 2026 - 13:48

List Question

Struggling to understand the definition of the class NP.

What is the computational complexity of expression minimization over a distributive lattice?

Why write computational complexity as $O\left( m n \log (n^2 / m) \right)$?

Which complexity problem is this related to?

Computational complexity of graph operations

$T(n)=4T(n/3)+n\log_2(n)$

Complexity of matrix multiplication with different size

Truncate a sum in order to speed up an algorithm (Big O)

Why is $T(n)=2T\left(\frac{n}{2}\right) + n\log(n)$ time complexity is $Θ\big( n\log^2(n) \big) $?

Using matrices for a recurrence to compute $a_n$ in $O(\log n)$

overall complexity of additive algorithm

Is $\mathcal{O}(a^n) = \mathcal{O}(b^n)$ for $a,b > 1$?

Induction proof of $T(n)=T(\lfloor \alpha n \rfloor)+T(\lfloor(1−\alpha)n\rfloor)+1=O(n)$

Efficient Evaluation of the Expression

A machine can compare at most three integers in one run. Show that at least $k(n) := \lceil log_6(n!) \rceil$ runs are needed to sort $n$ integers.

Trending Questions

Popular # Hahtags

Popular Questions