List questions from computational-complexity

Published on 03 Apr 2026 - 10:53

55

Views

Is it true that $\sum_{k=1}^n \frac{2^k}{k(k+1)} = O \left( \frac{2^n}{n(n+1)} \right)$?

Published on 01 Nov 2017 - 23:11

185

Views

$T(n)=4 \cdot T \left(\frac{\sqrt{n}}{3} \right) + \log^2 n$

Published on 02 Nov 2017 - 18:54

72

Views

For any $NP$ set $A$, are subsets of $A$ also in $NP$? Proof check

Published on 03 Nov 2017 - 16:55

810

Views

Complexity of determinant algorithms

Published on 03 Nov 2017 - 21:47

79

Views

Why are the formula's of negative entropy and computational complexity so close?

Published on 07 Apr 2026 - 11:15

144

Views

Are Frege and extended Frege systems separated conclusively?

Published on 05 Nov 2017 - 16:23

62

Views

Showing that $3/4$ of all words over $\{0,1\}^n$ have $K(w) \geq n-2$

Published on 25 Mar 2026 - 12:50

3k

Views

Constant value in definition of Big-O notation

Published on 09 Nov 2017 - 2:30

46

Views

Linear system of inequalities (aka. validity of a polytope)

Published on 14 Nov 2017 - 6:07

24

Views

Algorithm for solving equations whose coefficients are binary

Published on 14 Nov 2017 - 15:15

181

Views

Can this problem be solved in polynomial time?

Published on 27 Mar 2026 - 19:31

19

Views

Let $f(n) = 2^\sqrt{n}$ and $g \in \mathbb{R}[T] \implies g = \mathcal{O}(f)$.

Published on 25 Mar 2026 - 22:06

181

Views

Computational Inferiority of equivalent formulas

Published on 02 Apr 2026 - 4:28

3.8k

Views

Hamiltonian Path to Hamiltonian Cycle reduction

Published on 26 Mar 2026 - 2:54

List Question

What is the computational complexity for regular languages?

Is it true that $\sum_{k=1}^n \frac{2^k}{k(k+1)} = O \left( \frac{2^n}{n(n+1)} \right)$?

$T(n)=4 \cdot T \left(\frac{\sqrt{n}}{3} \right) + \log^2 n$

For any $NP$ set $A$, are subsets of $A$ also in $NP$? Proof check

Complexity of determinant algorithms

Why are the formula's of negative entropy and computational complexity so close?

Are Frege and extended Frege systems separated conclusively?

Showing that $3/4$ of all words over $\{0,1\}^n$ have $K(w) \geq n-2$

Constant value in definition of Big-O notation

Linear system of inequalities (aka. validity of a polytope)

Algorithm for solving equations whose coefficients are binary

Can this problem be solved in polynomial time?

Let $f(n) = 2^\sqrt{n}$ and $g \in \mathbb{R}[T] \implies g = \mathcal{O}(f)$.

Computational Inferiority of equivalent formulas

Hamiltonian Path to Hamiltonian Cycle reduction

Trending Questions

Popular # Hahtags

Popular Questions