News for hackers. Stuff that matters.

A comment on 'Breakthrough' algorithm exponentially faster than any previous one. Parent comment

Re:'Breakthrough' algorithm exponentially faster than any pr... by FlukE_ on Tuesday July 03, 2018 @10:31AM (#17450472)
'The researchers will present their novel approach at two upcoming conferences: the ACM Symposium on Theory of Computing (STOC), June 25-29 and International Conference on Machine Learning (ICML), July 10 -15.' I couldn't find anything with some googling so I'm assuming this quote describes the first showing of the paper.
[ Parent | on HN ]
Re:'Breakthrough' algorithm exponentially faster than any pr... by rindalir on Tuesday July 03, 2018 @10:42AM (#17450584)
https://scholar.harvard.edu/files/ericbalkanski/files/the-ad...
[ Parent | on HN ]
Re:'Breakthrough' algorithm exponentially faster than any pr... by MaxBarraclough on Tuesday July 03, 2018 @10:47AM (#17450618)
I don't think that's it. That's one of Singer's earlier works.

I'm fairly sure the relevant one is https://arxiv.org/pdf/1804.06355.pdf (listed as 'under submission' at https://people.seas.harvard.edu/~yaron/papers.html , in line with the article's description)

[ Parent | on HN ]
Re:'Breakthrough' algorithm exponentially faster than any pr... by rindalir on Tuesday July 03, 2018 @01:25PM (#17452028)
The one I posted is the one that was accepted at STOC this year.
[ Parent | on HN ]