Auberon's user avatar
Auberon's user avatar
Auberon's user avatar
Auberon
  • Member for 9 years, 2 months
  • Last seen this week
  • Menen
17 votes
Accepted

Why are computable functions also called recursive functions?

11 votes

How to avoid getting stuck on local optimum, for genetic algorithms

7 votes
Accepted

The difference between theoretical complexity and practical efficiency

7 votes
Accepted

Why do grammars in Chomsky Normal Form have derivations of length 2n-1?

5 votes
Accepted

Go Back N ARQ Question

5 votes
Accepted

Misconception in taking Pumping Length of language {a} to be $2$

5 votes

Why is (small) $o(n^2) \neq n^2$?

4 votes

Function problems and $FP \subseteq FNP$

4 votes
Accepted

How is the complexity of recursive algorithms calculated and do they admit better complexity than non-recursive algorithms?

4 votes
Accepted

Genetic Algorithms - Tournament Selection

2 votes

Function problems and $FP \subseteq FNP$

2 votes

How can I prove the correctness of this exponentiation algorithm using induction?

2 votes
Accepted

Resending old frame when a damaged frame has been received in one bit sliding window protocol

1 vote
Accepted

Metaheuristic for NP-complete problem without exact algorithms other than brute-force

1 vote

Red Black Tree clarification

1 vote

How do I simplify this boolean expression?

0 votes

implementing simple elvator algoirthm

0 votes

NP problems with exponentially complex average time solution?

-3 votes

Complexity of finding factors of a number