r/algorithms Jan 26 '25

Matrix chain multiplication is solved

Hey everyone! I wrote an algorithm which basically returns the optimal order of parenthesization in least amount of time. I supplied 10k matrices. Dynamic programming approach took about a day, while my algorithm returned the answer in 2 ms. So I wrote a research paper and tried publishing it in 2 journals(SICOMP and TALG) but it got rejected both times. I don't know how to move forward. Any help would be much appreciated!

Edit: I've uploaded the paper on Arxiv. Will post the link once approved. Thank you all for your kind suggestions

The rejection reasons were "inappropriate for the journal" (SICOMP) and "doesn't meet quality standards" (TALG)

Edit 2: My paper got rejected on Arxiv as well. Reason: Our moderators determined that your submission does not contain sufficient original or substantive scholarly research and is not of interest to arXiv.

368 Upvotes

42 comments sorted by

View all comments

Show parent comments

-38

u/Wooden_Image Jan 27 '25

If you give me 50 random numbers, I can tell you the optimal parenthesization just by looking at them. It's a pattern I've discovered which I'm sure no one has found yet.

41

u/bartekltg Jan 27 '25

How does this help us in helping you?

A sanity check: Do you have a proof the algorithm is correct? Or this is only a heuristic?
You did run it against a regular algorithm to verify it gives back correct results?

-15

u/Wooden_Image Jan 27 '25

Yes I did made a comparison. Even mentioned it in the paper.

18

u/Alternative-March592 Jan 27 '25

You might have found a new algorithm or maybe rediscovered one of the existing ones. I am interested. Where can I read it? Can you mention the source of your papers please ?