An optimal algorithm with unknown time complexity for convex matrix searching
- 1 November 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 36 (3) , 147-151
- https://doi.org/10.1016/0020-0190(90)90084-b
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An Almost Linear Time Algorithm for Generalized Matrix SearchingSIAM Journal on Discrete Mathematics, 1990
- A linear time algorithm for finding all farthest neighbors in a convex polygonInformation Processing Letters, 1989
- Speeding up dynamic programming with applications to molecular biologyTheoretical Computer Science, 1989
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- Rapid dynamic programming algorithms for RNA secondary structureAdvances in Applied Mathematics, 1986
- Speed-Up in Dynamic ProgrammingSIAM Journal on Algebraic Discrete Methods, 1982