Estimates of the complexity of a method to solve the problem of inclusive search

DOI10.1515/DMA.2000.10.3.295zbMATH Open0969.68051OpenAlexW2052146680MaRDI QIDQ4522876

El'yar E. Gasanov

Publication date: 10 May 2001

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

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

zbMATH Keywords

inclusive search

Mathematics Subject Classification ID

Searching and sorting (68P10) Boolean functions (06E30)

Related Items (2)

Quantile and mean value measures of search process complexity ⋮ Title not available (Why is that?)

This page was built for publication: Estimates of the complexity of a method to solve the problem of inclusive search

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