Searching for "Subquadratic Algorithms for 3SUM." – sorted by Relevance.
-
Subquadratic algorithms for 3SUM
- Subquadratic Algorithms for 3SUM Ilya Baran Erik D. Demaine Mihai Pǎtra¸scu MIT Computer Science
- Cited by 7 (2 self) – Add To MetaCart
-
3SUM-Hard Problems
- to find a subquadratic algorithm for P without finding a subquadratic algorithm for 3SUM. For each
- Add To MetaCart
-
New Lower Bounds for Convex Hull Problems in Odd Dimensions
- to the problem in question. Thus, a sub-quadratic algorithm for any 3sum-hard problem would imply a sub-quadratic
- Cited by 25 (7 self) – Add To MetaCart
-
Polygon Containment And Translational Min-Hausdorff-Distance Between Segment Sets Are
- subquadratic algorithm for 3sum, which is widely conjectured not to exist. 5 In a similar fashion Barrera 4
- Cited by 8 (0 self) – Add To MetaCart
-
Some Variants of Polygon Containment and Minimum Hausdorff Distance under Translation are 3SUM-Hard
- algorithm for 3sum, which is conjectured in [GO95] not to exist. In this paper we gradually establish
- Cited by 2 (0 self) – Add To MetaCart

