List questions from computational-complexity

Published on 26 Mar 2026 - 19:14

23

Views

How can I find the complexity of this recurrence?

Published on 26 May 2020 - 17:31

46

Views

What is the time complexity of the function $5^{\log_3(n)}+n^{1.5}\sum_{j=0}^{log_3n-1}\left(\frac{5}{3^{1.5}}\right)^j$?

Published on 26 May 2020 - 21:13

45

Views

Good reference that discusses NP hardness in the context of optimization?

Published on 27 May 2020 - 0:33

338

Views

Question about SAT and assignment

Published on 25 Mar 2026 - 19:00

24

Views

Growth rate of integration

Published on 28 May 2020 - 19:31

269

Views

Rice theorem and trivial properties for decidability proof

Published on 23 Feb 2026 - 8:31

192

Views

Most effective algorithms for each step of the basic RSA-Algorithm

Published on 28 Mar 2026 - 2:09

62

Views

Which can be calculated faster? (Fast Fourier Transform)

Published on 25 Mar 2026 - 16:09

906

Views

Does the Riemann hypothesis guarantee that integer factorization is difficult?

Published on 25 Mar 2026 - 19:00

95

Views

Heuristic for Turing Completeness?

Published on 28 Mar 2026 - 15:18

46

Views

Can this sum of fractions of pairwise sums be computed efficiently?

Published on 30 Mar 2026 - 2:11

45

Views

Linear programming with approximate arithmetic

Published on 28 Mar 2026 - 22:37

141

Views

Is the following a good/accurate definition for an enumerator (a kind of Turing machine)?

Published on 26 Mar 2026 - 13:46

42

Views

If $f(n)$ $\in$ $O(g(n))$ and $O(h(n))$ $\subset$ $O(g(n))$, Can we say that in general $f(n)$ $\not\in$ $O(h(n))$

Published on 05 Jun 2020 - 18:13

List Question

Algorithm problem - Help

How can I find the complexity of this recurrence?

What is the time complexity of the function $5^{\log_3(n)}+n^{1.5}\sum_{j=0}^{log_3n-1}\left(\frac{5}{3^{1.5}}\right)^j$?

Good reference that discusses NP hardness in the context of optimization?

Question about SAT and assignment

Growth rate of integration

Rice theorem and trivial properties for decidability proof

Most effective algorithms for each step of the basic RSA-Algorithm

Which can be calculated faster? (Fast Fourier Transform)

Does the Riemann hypothesis guarantee that integer factorization is difficult?

Heuristic for Turing Completeness?

Can this sum of fractions of pairwise sums be computed efficiently?

Linear programming with approximate arithmetic

Is the following a good/accurate definition for an enumerator (a kind of Turing machine)?

If $f(n)$ $\in$ $O(g(n))$ and $O(h(n))$ $\subset$ $O(g(n))$, Can we say that in general $f(n)$ $\not\in$ $O(h(n))$

Trending Questions

Popular # Hahtags

Popular Questions