List questions from computational-complexity

Published on 07 Sep 2018 - 11:42

72

Views

How to prove P $\subseteq$ NP without machines?

Published on 09 Sep 2018 - 5:56

586

Views

Degree of polynomial expressing OR of n Boolean variables

Published on 10 Sep 2018 - 15:56

51

Views

How can I reduce this expression to a complexity?

Published on 13 Sep 2018 - 9:56

29

Views

Is it sufficient to show the following inequality holds to prove $2^{2^n} \in \Omega(n!)$?

Published on 15 Sep 2018 - 16:16

223

Views

Time complexity analysis of finding the largest prime divisor

Published on 17 Sep 2018 - 2:22

667

Views

Why adding a few rows of constraints can dramatically slow down the running time of MIP optimization?

Published on 25 Mar 2026 - 16:42

45

Views

Reccurrent equation

Published on 18 Sep 2018 - 14:52

140

Views

True or False: $(n + \log(n))(n+8)$ is $O(n)$

Published on 19 Sep 2018 - 21:41

52

Views

True or false: $n^2 + 2n^2 + 3n^2 + 4n^2 + ... n(n^2)$ is $O(n^2)$

Published on 20 Sep 2018 - 0:24

77

Views

Why am I unable to observe $O(n^2)$ time complexity with Bubble Sort?

Published on 25 Mar 2026 - 11:12

3.5k

Views

Solving a recurrence relation with floor function

Published on 20 Sep 2018 - 15:56

779

Views

Bivariate Poisson-Binomial distribution.

Published on 25 Mar 2026 - 18:45

52

Views

Can we characterize the nature of the curve $\int x^{-1 + \epsilon} dx$ as it becomes non-polynomial?

Published on 21 Sep 2018 - 13:32

196

Views

Time complexity of finding the largest Goldbach partition

Published on 25 Mar 2026 - 6:02

List Question

Maximising the distance between $n$ points in a 2d region

How to prove P $\subseteq$ NP without machines?

Degree of polynomial expressing OR of n Boolean variables

How can I reduce this expression to a complexity?

Is it sufficient to show the following inequality holds to prove $2^{2^n} \in \Omega(n!)$?

Time complexity analysis of finding the largest prime divisor

Why adding a few rows of constraints can dramatically slow down the running time of MIP optimization?

Reccurrent equation

True or False: $(n + \log(n))(n+8)$ is $O(n)$

True or false: $n^2 + 2n^2 + 3n^2 + 4n^2 + ... n(n^2)$ is $O(n^2)$

Why am I unable to observe $O(n^2)$ time complexity with Bubble Sort?

Solving a recurrence relation with floor function

Bivariate Poisson-Binomial distribution.

Can we characterize the nature of the curve $\int x^{-1 + \epsilon} dx$ as it becomes non-polynomial?

Time complexity of finding the largest Goldbach partition

Trending Questions

Popular # Hahtags

Popular Questions