Threesomes, Degenerates, and Love Triangles

From MaRDI portal
Publication:4561510

DOI10.1145/3185378zbMath1422.68112arXiv1404.0799OpenAlexW2963410133MaRDI QIDQ4561510

Seth Pettie, Allan Grønlund

Publication date: 6 December 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.0799




Related Items (28)

Matching Triangles and Basing Hardness on an Extremely Popular ConjectureDynamic Set IntersectionGeometric pattern matching reduces to \(k\)-SUMFour Soviets walk the dog: improved bounds for computing the Fréchet distanceMind the gap!Subquadratic algorithms for algebraic 3SUMA nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree modelTime and space efficient collinearity indexingSearching for Point Locations Using LinesUnnamed ItemUnnamed ItemOnline recognition of dictionary with one gapGraphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH failsA subquadratic algorithm for 3XORGeometric Pattern Matching Reduces to k-SUM.Improved subquadratic 3SUMCapturing points with a rotating polygon (and a 3D extension)Into the square: on the complexity of some quadratic-time solvable problemsConnectivity Oracles for Graphs Subject to Vertex FailuresOn Multidimensional and Monotone k-SUMImproved Bounds for 3SUM, k-SUM, and Linear DegeneracyDynamic data structures for timed automata acceptanceFrom Circuit Complexity to Faster All-Pairs Shortest PathsSubquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree modelTesting polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problemsOn 3SUM-hard problems in the decision tree model3SUM, 3XOR, trianglesA comparative study of dictionary matching with gaps: limitations, techniques and challenges




This page was built for publication: Threesomes, Degenerates, and Love Triangles