List questions from computational-complexity

Published on 02 May 2021 - 16:07

32

Views

Is $2^{o(k)} = 2^{o(3k)}$?

Published on 04 May 2021 - 13:54

290

Views

Properties of a digit sum and modulo

Published on 08 Apr 2026 - 21:08

90

Views

Show if the IS is NP-Complete

Published on 11 Apr 2026 - 17:57

15

Views

Problem deriving b using the master theorem

Published on 12 Apr 2026 - 10:27

66

Views

How come that I approximate a matrix by a product of less order matrices and I have more elements in the end?

Published on 01 Apr 2026 - 11:59

72

Views

Where does $\frac{x}{\log(x)}$ overtake $x^p$ for $0<p<1$?

Published on 11 May 2021 - 19:03

33

Views

Complexity of representing all satisfying assignments

Published on 11 Apr 2026 - 10:33

645

Views

Understanding polynomial-growth condition

Published on 09 Apr 2026 - 5:48

58

Views

Is there a way to indicate $NP^{\prod_i^P}$ or $coNP^{\prod_i^P}$ like in polynomial hierarchy?

Published on 15 May 2021 - 18:22

125

Views

Halving input but not at each step of a process

Published on 12 Apr 2026 - 18:13

53

Views

Can a theorem determine its own complexity?

Published on 25 Mar 2026 - 17:29

161

Views

Problem of finding shortest proof - how complex is it?

Published on 25 Mar 2026 - 15:58

47

Views

What is the complexity of this algorithm's formula?

Published on 12 Apr 2026 - 1:47

53

Views

Is there a unit of measure for computational complexity; through quantum computers?

Published on 10 Apr 2026 - 6:00

List Question

Number of ways to arrange pairs of integers with distance constraint

Is $2^{o(k)} = 2^{o(3k)}$?

Properties of a digit sum and modulo

Show if the IS is NP-Complete

Problem deriving b using the master theorem

How come that I approximate a matrix by a product of less order matrices and I have more elements in the end?

Where does $\frac{x}{\log(x)}$ overtake $x^p$ for $0<p<1$?

Complexity of representing all satisfying assignments

Understanding polynomial-growth condition

Is there a way to indicate $NP^{\prod_i^P}$ or $coNP^{\prod_i^P}$ like in polynomial hierarchy?

Halving input but not at each step of a process

Can a theorem determine its own complexity?

Problem of finding shortest proof - how complex is it?

What is the complexity of this algorithm's formula?

Is there a unit of measure for computational complexity; through quantum computers?

Trending Questions

Popular # Hahtags

Popular Questions