List questions from computational-complexity

58

Views

How can I find which is the most appropriate symbol (O, o, $\Omega$, $\theta$, $\omega$) to describe $f(n)\in$__ $g(n)$?

Published on 22 Sep 2018 - 15:39

70

Views

Simplified Θ notation for $\ f(n) = n^\frac{(3loglogn)}{logn + 5}$

Published on 25 Sep 2018 - 19:19

17

Views

complexity involving exponential of different order

Published on 26 Sep 2018 - 23:42

42

Views

How fast can we approximate a real number using $n$ comparisons to it?

Published on 29 Sep 2018 - 21:56

129

Views

Why is showing that ILP in NP not trivial

Published on 25 Mar 2026 - 6:03

18

Views

A concise way of representing complexities.

Published on 01 Oct 2018 - 2:14

788

Views

Recurrence Relation when n is a fraction?

Published on 01 Oct 2018 - 16:47

211

Views

Simplex Methods and P problems

Published on 02 Oct 2018 - 7:16

195

Views

Solving an optimization problem with lower computational complexity

Published on 23 Feb 2026 - 5:19

150

Views

Optimizing Polygon Search

Published on 25 Mar 2026 - 17:28

66

Views

is n! = $\theta((n+1!))$ Asymptotic notation

Published on 05 Oct 2018 - 3:07

242

Views

Groebner Basis calculation for degree 2 polynomials

Published on 08 Oct 2018 - 21:27

117

Views

Simplifying $\sum_{i=0}^{\log n} \frac{n}{\log\left(\frac{n}{2^i}\right)}$

Published on 09 Oct 2018 - 16:58

106

Views

Computational complexity of sizes and number of orbits of a group acting on a set

Published on 25 Mar 2026 - 20:36

30

Views

A function that is $\mathcal O ( n^{1+\varepsilon}))$

Published on 10 Oct 2018 - 15:59

List Question

How can I find which is the most appropriate symbol (O, o, $\Omega$, $\theta$, $\omega$) to describe $f(n)\in$__ $g(n)$?

Simplified Θ notation for $\ f(n) = n^\frac{(3loglogn)}{logn + 5}$

complexity involving exponential of different order

How fast can we approximate a real number using $n$ comparisons to it?

Why is showing that ILP in NP not trivial

A concise way of representing complexities.

Recurrence Relation when n is a fraction?

Simplex Methods and P problems

Solving an optimization problem with lower computational complexity

Optimizing Polygon Search

is n! = $\theta((n+1!))$ Asymptotic notation

Groebner Basis calculation for degree 2 polynomials

Simplifying $\sum_{i=0}^{\log n} \frac{n}{\log\left(\frac{n}{2^i}\right)}$

Computational complexity of sizes and number of orbits of a group acting on a set

A function that is $\mathcal O ( n^{1+\varepsilon}))$

Trending Questions

Popular # Hahtags

Popular Questions