User Auberon

16 votes

Accepted

Why are computable functions also called recursive functions?

answered Jan 13, 2016 at 1:28

11 votes

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

answered Mar 23, 2016 at 17:48

7 votes

Accepted

The difference between theoretical complexity and practical efficiency

answered Mar 20, 2016 at 23:57

7 votes

Accepted

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

answered Mar 28, 2016 at 17:46

5 votes

Accepted

Go Back N ARQ Question

answered Jun 16, 2016 at 21:53

5 votes

Accepted

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

answered Mar 9, 2016 at 10:49

5 votes

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

answered Mar 26, 2016 at 20:49

4 votes

Function problems and $FP \subseteq FNP$

answered Mar 17, 2017 at 17:31

4 votes

Accepted

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

answered Apr 11, 2016 at 19:04

4 votes

Accepted

Genetic Algorithms - Tournament Selection

answered May 7, 2016 at 16:23

2 votes

Function problems and $FP \subseteq FNP$

answered Mar 27, 2017 at 22:31

2 votes

Accepted

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

answered Mar 21, 2016 at 17:14

1 vote

Accepted

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

answered Mar 16, 2016 at 18:39

1 vote

Red Black Tree clarification

answered Feb 21, 2015 at 22:08

1 vote

How do I simplify this boolean expression?

answered Mar 27, 2016 at 12:46

1 vote

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

answered Oct 28, 2020 at 13:47

0 votes

NP problems with exponentially complex average time solution?

answered May 10, 2016 at 10:50

0 votes

implementing simple elvator algoirthm

answered Mar 26, 2016 at 22:53

-3 votes

Complexity of finding factors of a number

answered Apr 15, 2016 at 20:41

Stack Exchange Network

19 Answers

Why are computable functions also called recursive functions?

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

The difference between theoretical complexity and practical efficiency

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

Go Back N ARQ Question

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

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

Function problems and $FP \subseteq FNP$

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

Genetic Algorithms - Tournament Selection

Function problems and $FP \subseteq FNP$

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

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

Red Black Tree clarification

How do I simplify this boolean expression?

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

NP problems with exponentially complex average time solution?

implementing simple elvator algoirthm

Complexity of finding factors of a number