Superlinear bounds for matrix searching problems

DOI10.1016/0196-6774(92)90005-WzbMath0745.90062OpenAlexW1975990553MaRDI QIDQ3990615

Maria M. Klawe

Publication date: 28 June 1992

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(92)90005-w

zbMATH Keywords

computational geometrytotally monotone partial matricesMatrix searching

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Dynamic programming (90C39) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

Unnamed Item

This page was built for publication: Superlinear bounds for matrix searching problems