The following pages link to Subquadratic algorithms for 3SUM (Q2482729):
Displaying 23 items.
- 3SUM, 3XOR, triangles (Q261365) (← links)
- On the least trimmed squares estimator (Q472475) (← links)
- Improved subquadratic 3SUM (Q513274) (← links)
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- Capturing points with a rotating polygon (and a 3D extension) (Q2000002) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Dynamic Set Intersection (Q3449844) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- (Q5002674) (← links)
- A subquadratic algorithm for 3XOR (Q5005162) (← links)
- (Q5009621) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- On Multidimensional and Monotone k-SUM (Q5111265) (← links)
- (Q5116497) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)
- Faster combinatorial \(k\)-clique algorithms (Q6547932) (← links)
- \(k\)-SUM in the sparse regime: complexity and applications (Q6648210) (← links)
