| ▲ | remywang 4 hours ago | |||||||||||||
3SUM is (was?) one of the key conjectures in fine-grained complexity, mostly used to derive lower bounds for other problems. As such, most did not think a subquadratic algorithm was possible. Similar for APSP | ||||||||||||||
| ▲ | sigbottle 3 hours ago | parent [-] | |||||||||||||
But from what I understand this doesn't refute SETH, no? | ||||||||||||||
| ||||||||||||||