List questions from computational-complexity

Published on 27 Mar 2026 - 13:19

277

Views

Find the smallest integer $n$ such that $5x^5 + (\log x)^{5^5} \in O(x^n).$

Published on 29 Oct 2019 - 21:45

1.1k

Views

complexity of linear programming

Published on 30 Oct 2019 - 8:57

207

Views

What is the computational complexity of Romberg Integration?

Published on 31 Oct 2019 - 22:52

141

Views

Competing ways to calculate the probability?

Published on 26 Mar 2026 - 9:49

18

Views

Time spent multiplying with expoDC and D&C

Published on 27 Mar 2026 - 7:47

29

Views

How to find $k$ smallest elements with least comparisons, if $m$ elements can be compared each time?

Published on 02 Nov 2019 - 15:50

95

Views

Complexity Of A Recurrence Summation.

Published on 28 Mar 2026 - 1:06

74

Views

Prove that $f(n)=o(g(n))$ implies there is computable $h(n)=o(g(n)) \in O_C(g(n))$ s.t. $f(n)=o(h(n))$

Published on 06 Nov 2019 - 17:44

99

Views

Complexity problem with boolean functions.

Published on 08 Nov 2019 - 21:12

3.2k

Views

Prove: $n\log(n^2) + (\log\ n)^2 = O(n\log(n))$

Published on 09 Nov 2019 - 21:28

111

Views

Does all unary language belongs to P questions?

Published on 10 Nov 2019 - 4:06

23

Views

I have to prove this inequality using the complexity classes.

Published on 10 Nov 2019 - 7:41

172

Views

Complexity of Quicksort

Published on 29 Mar 2026 - 15:37

328

Views

Computational complexity of calculating the $n$th derivative of $f(x)=\exp\bigg(\frac{1}{\ln(x)}+\frac{1}{\ln(1-x)}\bigg)$?

Published on 11 Nov 2019 - 2:58

List Question

Listing the number of ways of choosing $m$ objects with replacement from $n$ objects

Find the smallest integer $n$ such that $5x^5 + (\log x)^{5^5} \in O(x^n).$

complexity of linear programming

What is the computational complexity of Romberg Integration?

Competing ways to calculate the probability?

Time spent multiplying with expoDC and D&C

How to find $k$ smallest elements with least comparisons, if $m$ elements can be compared each time?

Complexity Of A Recurrence Summation.

Prove that $f(n)=o(g(n))$ implies there is computable $h(n)=o(g(n)) \in O_C(g(n))$ s.t. $f(n)=o(h(n))$

Complexity problem with boolean functions.

Prove: $n\log(n^2) + (\log\ n)^2 = O(n\log(n))$

Does all unary language belongs to P questions?

I have to prove this inequality using the complexity classes.

Complexity of Quicksort

Computational complexity of calculating the $n$th derivative of $f(x)=\exp\bigg(\frac{1}{\ln(x)}+\frac{1}{\ln(1-x)}\bigg)$?

Trending Questions

Popular # Hahtags

Popular Questions