List questions from computational-complexity

Published on 07 Apr 2026 - 17:34

121

Views

Polynomial transform (P, NP)

Published on 10 Dec 2012 - 22:57

3.9k

Views

Proof that computing composition of permutations is in P

Published on 08 Apr 2026 - 8:04

100

Views

Big Omega Proof Switch

Published on 11 Dec 2012 - 2:01

2.5k

Views

How to prove perm-power is in P?

Published on 09 Apr 2026 - 7:27

48

Views

Why does it take maximum of $n/\log n$ digits to represent the number $2^n - 1$ in base of $n$?

Published on 13 Dec 2012 - 18:48

39.4k

Views

What is the time complexity of Euclid's Algorithm (Upper bound,Lower Bound and Average)?

Published on 14 Dec 2012 - 9:51

172

Views

How to find $(-64\mathrm{i}) ^{1/3}$?

Published on 15 Dec 2012 - 16:09

589

Views

Is there a function that only generates primes?

Published on 05 Apr 2026 - 0:10

98

Views

"Balancing" two infinities

Published on 17 Dec 2012 - 2:43

1.4k

Views

show that careful 5COLOR is in NP

Published on 17 Dec 2012 - 3:09

456

Views

What's the most efficient algorithm for Divisibility?

Published on 08 Apr 2026 - 20:23

113

Views

2sat approximation related problem.

Published on 23 Dec 2012 - 12:12

197

Views

Does $\Theta(m \log n)$ and $0 < m < n^2$ imply $\Theta(n^2 \log n)$?

Published on 26 Dec 2012 - 12:23

546

Views

What is the computational complexity of the EM algorithm?

Published on 07 Apr 2026 - 14:37

List Question

Oracle turing machine

Polynomial transform (P, NP)

Proof that computing composition of permutations is in P

Big Omega Proof Switch

How to prove perm-power is in P?

Why does it take maximum of $n/\log n$ digits to represent the number $2^n - 1$ in base of $n$?

What is the time complexity of Euclid's Algorithm (Upper bound,Lower Bound and Average)?

How to find $(-64\mathrm{i}) ^{1/3}$?

Is there a function that only generates primes?

"Balancing" two infinities

show that careful 5COLOR is in NP

What's the most efficient algorithm for Divisibility?

2sat approximation related problem.

Does $\Theta(m \log n)$ and $0 < m < n^2$ imply $\Theta(n^2 \log n)$?

What is the computational complexity of the EM algorithm?

Trending Questions

Popular # Hahtags

Popular Questions