List questions from computational-complexity

Published on 25 Mar 2026 - 9:26

48

Views

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

Published on 10 Apr 2018 - 16:13

54

Views

Lower bound for asymptotic time of sorting algorithms

Published on 22 Mar 2026 - 19:30

181

Views

Is the set of formulas equivalent to a bounded formula decidable

Published on 23 Mar 2026 - 1:33

249

Views

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

Published on 15 Apr 2018 - 12:48

43

Views

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

Published on 23 Mar 2026 - 0:00

59

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 2018 - 16:26

64

Views

Why is $BPP \nsubseteq NP?$

Published on 17 Apr 2018 - 8:31

50

Views

Computational Complexity of finding out split graphs

Published on 17 Apr 2018 - 16:21

42

Views

Specific solutions of a random binary underdetermined linear system

Published on 18 Apr 2018 - 11:17

22

Views

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

Published on 25 Mar 2026 - 6:03

1.1k

Views

Time complexity “polynomial in n”

Published on 19 Apr 2018 - 13:02

150

Views

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

Published on 25 Mar 2026 - 12:55

79

Views

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

Published on 21 Apr 2018 - 15:09

251

Views

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

Published on 23 Apr 2018 - 6:56

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