Instantly solvable search problems

DOI10.1515/DMA.1996.6.5.467MaRDI QIDQ3125965zbMATH OpenOpenAlexFDO

Authors El'yar E. Gasanov

Publication date 23 March 1997

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

Full work available at URL https://doi.org/10.1515/dma.1996.6.5.467

zbMATH Keywords

instantly solvable search problems

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 999544
• A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
• The principle of selecten jumping searching and \(C,C_ 0',C^*\) algorithms
• scientific article; zbMATH DE number 3974291
• Search Problems in the Decision Tree Model

Cited in

(2)

• Information storage and search complexity theory
• scientific article; zbMATH DE number 999544 (Why is no real title available?)

This page was built for publication: Instantly solvable search problems

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