Pages that link to "Item:Q3990615"
From MaRDI portal
The following pages link to Superlinear bounds for matrix searching problems (Q3990615):
Displaying 6 items.
- Applications of generalized matrix searching to geometric algorithms (Q913505) (← links)
- An optimal algorithm with unknown time complexity for convex matrix searching (Q917275) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- Selection and sorting in totally monotone arrays (Q3979609) (← links)
- On Finding Supernodes for Sparse Matrix Computations (Q4033829) (← links)
- (Q5743404) (← links)