Pages that link to "Item:Q4561510"
From MaRDI portal
The following pages link to Threesomes, Degenerates, and Love Triangles (Q4561510):
Displaying 24 items.
- 3SUM, 3XOR, triangles (Q261365) (← links)
- Improved subquadratic 3SUM (Q513274) (← links)
- Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
- Capturing points with a rotating polygon (and a 3D extension) (Q2000002) (← links)
- Dynamic data structures for timed automata acceptance (Q2093569) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems (Q2105319) (← links)
- On 3SUM-hard problems in the decision tree model (Q2117780) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- Geometric pattern matching reduces to \(k\)-SUM (Q2172655) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Mind the gap! (Q2414857) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
- Time and space efficient collinearity indexing (Q2678263) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- A subquadratic algorithm for 3XOR (Q5005162) (← links)
- (Q5009621) (← links)
- On Multidimensional and Monotone k-SUM (Q5111265) (← links)
- Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy (Q5111730) (← links)
- (Q5875468) (← links)
- Geometric Pattern Matching Reduces to k-SUM. (Q6065434) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
