More Logarithmic-factor Speedups for 3SUM, (median,+)-convolution, and Some Geometric 3SUM-hard Problems
From MaRDI portal
Publication:4973055
DOI10.1145/3363541zbMath1454.68210OpenAlexW2987751358MaRDI QIDQ4973055
Publication date: 2 December 2019
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3363541
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (6)
On rainbow quadrilaterals in colored point sets ⋮ Time and space efficient collinearity indexing ⋮ How fast can we play Tetris greedily with rectangular pieces? ⋮ Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model ⋮ Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems ⋮ On 3SUM-hard problems in the decision tree model
This page was built for publication: More Logarithmic-factor Speedups for 3SUM, (median,+)-convolution, and Some Geometric 3SUM-hard Problems
