List questions from computational-complexity

Published on 27 Mar 2026 - 23:13

240

Views

Systematic way of creating the complement of a regular grammar?

Published on 30 Mar 2026 - 12:57

933

Views

Find the smallest natural number not in a given set of integers

Published on 10 Aug 2013 - 14:36

650

Views

Finding the shortest/"most negative" closed directed trail in a weighted digraph with negative weights

Published on 14 Aug 2013 - 6:32

164

Views

Computation of the mean of a random variable to estimate algorithm complexity

Published on 18 Aug 2013 - 9:47

3.5k

Views

Provide an algorithm $O (n ^ 3 \log n)$, any example?

Published on 26 Mar 2026 - 18:49

89

Views

Quadratic Diophantine Primality Testing

Published on 22 Aug 2013 - 23:07

114

Views

Differentiating between prime/semi-prime and other integers

Published on 23 Aug 2013 - 2:01

9.3k

Views

Upper bound for $T(n) = T(n - 1) + T(n/2) + n$ with recursion-tree

Published on 24 Aug 2013 - 13:49

52

Views

Abelian SubGroup Variant:

Published on 25 Aug 2013 - 1:59

274

Views

Will a problem be polynomial time solvable if a mathematician gives a procedure?

Published on 28 Aug 2013 - 22:58

1.3k

Views

Bound on total divisions of Euclid's Algorithm.

Published on 29 Aug 2013 - 21:49

192

Views

Verifying Algebraic Formulas

Published on 29 Aug 2013 - 22:30

88

Views

Calculating modular inverses with limited multiplication

Published on 30 Aug 2013 - 6:36

246

Views

For $f(n) = \log n$ and $g(n) = n^c$, where $0 < c < 1$, is it always true that $f$ is $O(g)$?

Published on 31 Aug 2013 - 11:07

List Question

A computer's memory is finite, so how can there be languages more powerful than regular?

Systematic way of creating the complement of a regular grammar?

Find the smallest natural number not in a given set of integers

Finding the shortest/"most negative" closed directed trail in a weighted digraph with negative weights

Computation of the mean of a random variable to estimate algorithm complexity

Provide an algorithm $O (n ^ 3 \log n)$, any example?

Quadratic Diophantine Primality Testing

Differentiating between prime/semi-prime and other integers

Upper bound for $T(n) = T(n - 1) + T(n/2) + n$ with recursion-tree

Abelian SubGroup Variant:

Will a problem be polynomial time solvable if a mathematician gives a procedure?

Bound on total divisions of Euclid's Algorithm.

Verifying Algebraic Formulas

Calculating modular inverses with limited multiplication

For $f(n) = \log n$ and $g(n) = n^c$, where $0 < c < 1$, is it always true that $f$ is $O(g)$?

Trending Questions

Popular # Hahtags

Popular Questions