Pages that link to "Item:Q4598221"
From MaRDI portal
The following pages link to Tight Hardness Results for Maximum Weight Rectangles (Q4598221):
Displaying 8 items.
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- (Q5002697) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Minimum membership covering and hitting (Q5918296) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
