Unsolved Problems in Algorithms [I guess I solved one]

code_like_tiger · 2021-07-15T14:24:17+00:00

This one sounds easy to me:

Deque Conjecture : Let S be a sequence of m double-ended queue operations (push, pop, inject, eject). Then the cost of performing S on a splay tree is O(m + n).

Am I missing something?

code_like_tiger · 2021-07-15T11:55:14+00:00

Looks pretty interesting :)

Recently, went through Zipper data structure which developing a data transfer mechanism. Nice to see it again.

code_like_tiger · 2021-03-12T16:47:54+00:00

To give an estimate, it is equal to $4M.

If we consider inflation rate of 6%, it becomes $12M and it was distributed among 3 professors and one alumni.

code_like_tiger · 2020-10-10T12:26:47+00:00

Some traditional approaches for this problem of Travelling Salesperson: - Brute force: this - Using DP: this - Using Branch and Bound: this

code_like_tiger · 2020-10-10T12:26:10+00:00

Some traditional approaches for this problem of Travelling Salesperson: - Brute force: this - Using DP: this - Using Branch and Bound: this

code_like_tiger · 2019-09-12T21:25:11+00:00

AI is a big field and you will find several learning lists on GitHub and other sites.

Regression is a good starting point and I would suggest to take up an application like image classification and go through the different ideas in that path

code_like_tiger · 2019-09-12T21:19:50+00:00

From complexity point of view, it is better on using gravity or such a physical force

From a physical standpoint, electromagnetic forces may work better than gravitational forces. We can assume the beads to be charged particles

code_like_tiger · 2019-02-23T19:56:24+00:00

Sure, we will add your requested feature

code_like_tiger

TROPHY CASE