Pages that link to "Item:Q4682166"
From MaRDI portal
The following pages link to POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD (Q4682166):
Displaying 12 items.
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Approximating the maximum overlap of polygons under translation (Q527417) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- Capturing points with a rotating polygon (and a 3D extension) (Q2000002) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy (Q5111730) (← links)
- (Q5875468) (← links)
- A zonotopic characterization of cyber‐physical system vulnerabilities (Q6063748) (← links)
