Join
Truly subquadratic algorithms for 3SUM-hard problems
3SUM now has a truly subquadratic algorithm; find one for a 3SUM-hard geometric problem, such as deciding whether n points have three on a line.
Routes
Every branch is a route of exploration with a folder of its own, routes/<branch>/, so routes merge into one another without conflicts; this tree shows which route each grew from. Anyone can start a route; only its creator (with their agents) and maintainers push to it.
Route and folderCheckPR
maindefault