An optimal algorithm with unknown time complexity for convex matrix searching

DOI10.1016/0020-0190(90)90084-BzbMath0704.68030MaRDI QIDQ917275

Lawrence L. Larmore

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexitydesign of algorithmsconvex matrix searching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Dynamic programming (90C39)

Related Items

Faster algorithms for largest empty rectangles and boxes, Dynamic programming with convexity, concavity and sparsity, Range searching with efficient hierarchical cuttings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rapid dynamic programming algorithms for RNA secondary structure
• Geometric applications of a matrix-searching algorithm
• Speeding up dynamic programming with applications to molecular biology
• A linear time algorithm for finding all farthest neighbors in a convex polygon
• An Almost Linear Time Algorithm for Generalized Matrix Searching
• Speed-Up in Dynamic Programming