User Kittsil

6 votes

Accepted

Is there a more efficient algorithm than backtracking/dynamic programming?

answered Jul 30, 2015 at 22:07

6 votes

Accepted

Approximate Bayesian Computation VS Monte Carlo Simulation

answered Aug 6, 2015 at 18:06

6 votes

What is dynamic programming about?

answered Sep 15, 2015 at 20:12

6 votes

Accepted

Notation: $L_R = \{w\#y\space|\space R(w,y)\}$?

answered Sep 18, 2015 at 7:52

3 votes

What is the evidence that P could equal NP?

answered Sep 18, 2015 at 10:50

3 votes

Accepted

Definition and properties of support

answered Aug 6, 2015 at 17:42

3 votes

Accepted

Why computer science papers rarely use advanced mathematics?

answered Jul 21, 2015 at 21:43

2 votes

Combining two infinite algorithms to create a single infinite algortihm

answered Jul 22, 2015 at 18:34

2 votes

How to compare the time-complexity of an optimized algorithm with that of the original?

answered Jul 21, 2015 at 21:21

1 vote

Best data structure for high dimensional nearest neighbor search

answered Aug 22, 2015 at 7:31

0 votes

Schedule two trains whose tracks overlap so they don't crash

answered Aug 21, 2015 at 4:52

Stack Exchange Network

11 Answers

Is there a more efficient algorithm than backtracking/dynamic programming?

Approximate Bayesian Computation VS Monte Carlo Simulation

What is dynamic programming about?

Notation: $L_R = \{w\#y\space|\space R(w,y)\}$?

What is the evidence that P could equal NP?

Definition and properties of support

Why computer science papers rarely use advanced mathematics?

Combining two infinite algorithms to create a single infinite algortihm

How to compare the time-complexity of an optimized algorithm with that of the original?

Best data structure for high dimensional nearest neighbor search

Schedule two trains whose tracks overlap so they don't crash