List questions from computational-complexity

Published on 21 Feb 2017 - 22:53

32

Views

Is $O(\frac{d^3}{m^2}+\frac{d^2}{m})= O(\frac{d^3}{m^2})$ if we always have the constraint $1<m<d$?

Published on 22 Feb 2017 - 17:02

2.4k

Views

Why $2^n$ is $\Theta (2^{n+1})$?

Published on 22 Feb 2017 - 17:25

81

Views

Proving NP-hardness of graph optimization problem

Published on 26 Mar 2026 - 9:39

366

Views

Simplify an expression of consecutive union / intersection operation

Published on 27 Feb 2017 - 11:06

79

Views

How fast does Euler's totient function drop?

Published on 28 Mar 2026 - 7:53

502

Views

Can an NP-complete problem have an infinite number of solutions?

Published on 28 Feb 2017 - 23:21

105

Views

Computational and decision Problems: definition and NP-completeness

Published on 26 Mar 2026 - 7:56

216

Views

The difficulty of following discrete logarithm problem.

Published on 23 Feb 2026 - 10:16

82

Views

NP-completeness and changing it for a decision problem

Published on 26 Mar 2026 - 9:39

108

Views

Simplify $a x b + a' x b' + a'' x b'' $?

Published on 05 Mar 2017 - 14:14

1.6k

Views

Big O of multiplication

Published on 06 Mar 2017 - 7:27

951

Views

$\Delta_n^0$-complete sets in the arithmetical hierarchy

Published on 29 Mar 2026 - 20:44

38

Views

Big O of calculating reminders

Published on 06 Mar 2017 - 16:59

444

Views

Prove : n * log(n) + m * log(m) < n * m

Published on 07 Mar 2017 - 19:45

List Question

Am I computing these summations the right way?

Is $O(\frac{d^3}{m^2}+\frac{d^2}{m})= O(\frac{d^3}{m^2})$ if we always have the constraint $1<m<d$?

Why $2^n$ is $\Theta (2^{n+1})$?

Proving NP-hardness of graph optimization problem

Simplify an expression of consecutive union / intersection operation

How fast does Euler's totient function drop?

Can an NP-complete problem have an infinite number of solutions?

Computational and decision Problems: definition and NP-completeness

The difficulty of following discrete logarithm problem.

NP-completeness and changing it for a decision problem

Simplify $a x b + a' x b' + a'' x b'' $?

Big O of multiplication

$\Delta_n^0$-complete sets in the arithmetical hierarchy

Big O of calculating reminders

Prove : n * log(n) + m * log(m) < n * m

Trending Questions

Popular # Hahtags

Popular Questions