List questions from computational-complexity

Published on 18 Nov 2015 - 1:43

317

Views

Abstract machines that compute primitive recursive functions

Published on 25 Mar 2026 - 9:40

301

Views

Asymptotic complexity of power of logs

Published on 20 Nov 2015 - 5:47

48

Views

The approximability of different NP-hard problems

Published on 01 Apr 2026 - 4:27

25

Views

Computational Complexity of exponentiating

Published on 21 Nov 2015 - 22:04

165

Views

set of Kolmogorov-random strings is co-re

Published on 01 Apr 2026 - 5:54

232

Views

Time Complexity of Sorting Algorithm

Published on 25 Mar 2026 - 14:35

24

Views

How to start dealing with this recurrence relation

Published on 24 Nov 2015 - 22:53

63

Views

Is the problem : Determine the number of groups with order $n$ NP-hard?

Published on 25 Nov 2015 - 11:10

78

Views

Is there a number $n$, such that there are $22$ groups of order $n$?

Published on 27 Nov 2015 - 14:22

78

Views

not any computable function f such that x is not in the Halting Problem iff f ( x ) belongs to set of Kolmogorov-random strings

Published on 27 Nov 2015 - 14:48

1.2k

Views

Giving tight asymptotic bounds for $ T ( n ) = T \left( \frac n { \log n } \right) + \log \log n $

Published on 30 Nov 2015 - 18:33

79

Views

How do we decide a problem is in NP, but not in P or NPC?

Published on 01 Dec 2015 - 3:58

143

Views

Algorithmic efficiency of rotating a point

Published on 03 Apr 2026 - 10:46

481

Views

How could I modify a Turing machine that attempts to move the head past the leftmost square(crash) on some inputs so that it doesn't crash at all?

Published on 27 Mar 2026 - 21:19

List Question

What does $\forall X: A^X \subseteq B^X$ mean?

Abstract machines that compute primitive recursive functions

Asymptotic complexity of power of logs

The approximability of different NP-hard problems

Computational Complexity of exponentiating

set of Kolmogorov-random strings is co-re

Time Complexity of Sorting Algorithm

How to start dealing with this recurrence relation

Is the problem : Determine the number of groups with order $n$ NP-hard?

Is there a number $n$, such that there are $22$ groups of order $n$?

not any computable function f such that x is not in the Halting Problem iff f ( x ) belongs to set of Kolmogorov-random strings

Giving tight asymptotic bounds for $ T ( n ) = T \left( \frac n { \log n } \right) + \log \log n $

How do we decide a problem is in NP, but not in P or NPC?

Algorithmic efficiency of rotating a point

How could I modify a Turing machine that attempts to move the head past the leftmost square(crash) on some inputs so that it doesn't crash at all?

Trending Questions

Popular # Hahtags

Popular Questions