Improved subquadratic 3SUM
From MaRDI portal
Publication:513274
Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 910895 (Why is no real title available?)
- All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
- Lower bounds for linear degeneracy testing
- On a class of \(O(n^ 2)\) problems in computational geometry
- Pattern matching under polynomial transformation
- Speeding up the four Russians algorithm by about one more logarithmic factor
- Subquadratic algorithms for 3SUM
- Threesomes, degenerates, and love triangles
- Towards polynomial lower bounds for dynamic problems
Cited in
(16)- More logarithmic-factor speedups for 3SUM, (median,+)-convolution, and some geometric 3SUM-hard problems
- 3SUM, 3XOR, triangles
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
- Subquadratic algorithms for algebraic 3SUM
- Geometric pattern matching reduces to \(k\)-SUM
- Geometric Pattern Matching Reduces to k-SUM.
- Threesomes, degenerates, and love triangles
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model
- Algorithms and Data Structures
- Subquadratic algorithms for 3SUM
- Time and space efficient collinearity indexing
- A subquadratic algorithm for 3XOR
- Subquadratic algorithms for algebraic generalizations of 3SUM
- More logarithmic-factor speedups for 3SUM, (median,+)-convolution, and some geometric 3SUM-hard problems
- Connectivity oracles for graphs subject to vertex failures
- Improved bounds for 3SUM, \(k\)-SUM, and linear degeneracy
This page was built for publication: Improved subquadratic 3SUM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513274)
