List questions from computational-complexity

Published on 25 Mar 2026 - 4:40

49

Views

What does the floating point arithmetic contribute to the rounding error in Mathematica?

Published on 17 Mar 2026 - 22:47

66

Views

Which equation system can be solved the fastest(orthogonal,spd,tridiagonal)?

Published on 24 Mar 2026 - 0:01

358

Views

Subarray minimal average

Published on 27 Feb 2018 - 10:29

729

Views

Prove log(log(n)) is Big-O (log(n))

Published on 27 Feb 2018 - 16:23

7.4k

Views

Show that Turing recognizable languages are closed under intersection.

Published on 25 Mar 2026 - 6:09

885

Views

Computational costs of different methods of solving systems of linear equations

Published on 21 Mar 2026 - 17:49

127

Views

How fast does $\frac{1}{n!} \sum_{k=0}^n k(n-k)!$ grow, as a function of $n$?

Published on 02 Mar 2018 - 5:02

124

Views

Quadratic knapsack: minimum variance

Published on 23 Mar 2026 - 13:19

104

Views

Big-O Notation Proof

Published on 05 Mar 2018 - 1:48

44

Views

How would we prove $\frac{n^2 - n}{2}$ is $\mathcal{O}(n^2)$?

Published on 06 Mar 2018 - 4:23

94

Views

Which computational complexity is larger, $O(2^n)$ or $O((\log{n})^{\log{n}})$?

Published on 07 Mar 2018 - 3:32

41

Views

Question on proof using an algorithm to find element in finite permutation group

Published on 07 Mar 2018 - 17:10

408

Views

Is generating a Turing Machine that output a given string $s$ in NP?

Published on 25 Mar 2026 - 4:36

1.3k

Views

Negative linear amortized time cost of operation obtained using the potential function method

Published on 10 Mar 2018 - 19:54

List Question

Show that of Turing decidable languages is closed under concatenation.

What does the floating point arithmetic contribute to the rounding error in Mathematica?

Which equation system can be solved the fastest(orthogonal,spd,tridiagonal)?

Subarray minimal average

Prove log(log(n)) is Big-O (log(n))

Show that Turing recognizable languages are closed under intersection.

Computational costs of different methods of solving systems of linear equations

How fast does $\frac{1}{n!} \sum_{k=0}^n k(n-k)!$ grow, as a function of $n$?

Quadratic knapsack: minimum variance

Big-O Notation Proof

How would we prove $\frac{n^2 - n}{2}$ is $\mathcal{O}(n^2)$?

Which computational complexity is larger, $O(2^n)$ or $O((\log{n})^{\log{n}})$?

Question on proof using an algorithm to find element in finite permutation group

Is generating a Turing Machine that output a given string $s$ in NP?

Negative linear amortized time cost of operation obtained using the potential function method

Trending Questions

Popular # Hahtags

Popular Questions