List questions from computational-complexity

Published on 10 May 2026 - 21:55

51

Views

Proving $(f \circ g)(n) \in O( (g \circ f)(n) ) $ given $f$ and $g$ are increasing functions

Published on 15 Apr 2026 - 18:13

59

Views

Lower bound for asymptotic time of sorting algorithms

Published on 10 May 2026 - 20:37

186

Views

Is the set of formulas equivalent to a bounded formula decidable

Published on 10 May 2026 - 17:42

252

Views

Is $\binom{n}{k}$ always considered polynomial?

Published on 12 Apr 2026 - 5:30

46

Views

Fast matrix multiplication for $a_{i,j}=a_{i-j}$ if $i\leq j$ else 0

Published on 27 Mar 2026 - 5:09

62

Views

If f=O(g), there is c>0 s.t. FOR ALL n $\in$ N: $f(n)\le c\cdot g(n)$

Published on 16 Apr 2026 - 21:36

67

Views

Why is $BPP \nsubseteq NP?$

Published on 12 Apr 2026 - 14:30

53

Views

Computational Complexity of finding out split graphs

Published on 13 Apr 2026 - 2:38

45

Views

Specific solutions of a random binary underdetermined linear system

Published on 11 Apr 2026 - 13:03

23

Views

On the number of MC simulation runs required to find computational complexity

Published on 10 May 2026 - 14:39

1.1k

Views

Time complexity “polynomial in n”

Published on 15 Apr 2026 - 20:21

152

Views

what does it mean for a problem to be non first order definable?

Published on 11 Apr 2026 - 22:20

81

Views

Is the cost of $\lVert \mathbf{v} \rVert_2$ really $O(n)$?

Published on 12 Apr 2026 - 1:57

254

Views

Time complexity of running a loop where the counter increased by log(j)?

Published on 14 Apr 2026 - 8:55

List Question

How to compute $x_{2i}$ directly from $x_i$ in this $x^2 \mod N$ sequence?

Proving $(f \circ g)(n) \in O( (g \circ f)(n) ) $ given $f$ and $g$ are increasing functions

Lower bound for asymptotic time of sorting algorithms

Is the set of formulas equivalent to a bounded formula decidable

Is $\binom{n}{k}$ always considered polynomial?

Fast matrix multiplication for $a_{i,j}=a_{i-j}$ if $i\leq j$ else 0

If f=O(g), there is c>0 s.t. FOR ALL n $\in$ N: $f(n)\le c\cdot g(n)$

Why is $BPP \nsubseteq NP?$

Computational Complexity of finding out split graphs

Specific solutions of a random binary underdetermined linear system

On the number of MC simulation runs required to find computational complexity

Time complexity “polynomial in n”

what does it mean for a problem to be non first order definable?

Is the cost of $\lVert \mathbf{v} \rVert_2$ really $O(n)$?

Time complexity of running a loop where the counter increased by log(j)?

Trending Questions

Popular # Hahtags

Popular Questions