Lower Bounds for Multiplication via Network Coding · HackerPapers discussions

Lower Bounds for Multiplication via Network Coding — mentioned by EvgeniyZh

Wed, 22 Jul 2020 19:51:44 GMT

There is a (conditional) proof that nlogn is optimal: https://arxiv.org/abs/1902.10935

Paper and discussion history. A mention is not an endorsement.

Lower Bounds for Multiplication via Network Coding — mentioned by ogogmad

Wed, 22 Jul 2020 19:26:08 GMT

According to the article, it rests on a plausible conjecture. I need to read further. [edit] According to the abstract of the paper referred to in the article (https://arxiv.org/abs/1902.10935) it rests on a "central conjecture in the area of network coding". Make of that what you will.

Paper and discussion history. A mention is not an endorsement.

Lower Bounds for Multiplication via Network Coding — mentioned by gumby

Wed, 17 Apr 2019 20:41:01 GMT

The article says that it may be the fastest: > At the end of February, a team of computer scientists at Aarhus University posted a paper [ https://arxiv.org/abs/1902.10935 ] arguing that if another unproven conjecture is also true, this is indeed the fastest way multiplication can be done.

Paper and discussion history. A mention is not an endorsement.

Lower Bounds for Multiplication via Network Coding — mentioned by moab

Mon, 25 Mar 2019 07:01:01 GMT

This very recent paper shows a matching (conditional) lower bound of \Omega(n\log n): https://arxiv.org/abs/1902.10935 (the hardness is from a conjecture in network coding).

Paper and discussion history. A mention is not an endorsement.

Lower Bounds for Multiplication via Network Coding — HN submission

Sun, 03 Mar 2019 09:43:03 GMT

Lower bounds for the cost of multiplication via network coding

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.