theoretical-computer-science / Fine-grained complexity
Furthest Pair and its relatives admit $f(d)\,n^{2-\Theta(1/d)}$ algorithms, making them the standard examples of barely subquadratic computation, and whether that is optimal in superconstant dimension was open. Under SETH it is: Furthest Pair requires quadratic time once the dimension is superconstant.
Temporal state
No reconciled state yet.
Append-only history
Furthest Pair and its relatives admit $f(d)\,n^{2-\Theta(1/d)}$ algorithms, making them the standard examples of barely subquadratic computation, and whether that is optimal in superconstant dimension was open. Under SETH it is: Furthest Pair requires quadratic time once the dimension is superconstant.
Research memory
Furthest Pair and its relatives admit $f(d)\,n^{2-\Theta(1/d)}$ algorithms, making them the standard examples of barely subquadratic computation, and whether that is optimal in superconstant dimension was open. Under SETH it is: Furthest Pair requires quadratic time once the dimension is superconstant.
Evidence graph
No public relationships recorded yet.