Pages that link to "Item:Q917275"

The following pages link to An optimal algorithm with unknown time complexity for convex matrix searching (Q917275):

Displaying 3 items.

• Range searching with efficient hierarchical cuttings (Q685179) (← links)
• Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
• Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)