Skip to main content
Ordoshsen's user avatar
Ordoshsen's user avatar
Ordoshsen's user avatar
Ordoshsen
  • Member for 7 years, 3 months
  • Last seen more than 1 year ago
3 votes

Does quantum computing convert any O(2^n) algorithm into a polynomial running time and how?

2 votes

Solving time of large TSP instances

2 votes

Hash maps vs extending structs / classes

2 votes

Decide whether the Language is regular {a^i b^j c^k|i ≥ 0, j ≥ 0, k ≥ 0}

2 votes

Is $\Sigma^*$ countable or uncountable?

1 vote

Similar problem to Subset Sum?

1 vote

Why this division algorithm works?

1 vote
Accepted

Pumping lemma with multiple of prime number + a constant

1 vote
Accepted

Determining runtime of a theoretical program (question of extraordinary complexity)?

1 vote
Accepted

Bound the sum of leaf depth on a complete binary tree of $n$ leaves

0 votes
Accepted

is it possible to do a DFA for these languages?

0 votes

Pumping lemma to show a language is not context free