On the functional complexity of a two-dimensional interval search problem

DOI10.1515/DMA-2002-0107MaRDI QIDQ4809560zbMATH OpenOpenAlexFDO

Authors El'yar E. Gasanov, I. V. Kuznetsova

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/dm/14/1/114

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Search theory (90B40) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• On a one-dimensional interval search problem
• A generalization of binary search
• The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees

Cited in

(4)

• Information storage and search complexity theory
• A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
• The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees
• On the Complexity of 2D Discrete Fixed Point Problem

This page was built for publication: On the functional complexity of a two-dimensional interval search problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809560)