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

DOI10.1515/DMA.2000.10.3.295MaRDI QIDQ4522876zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A lower bound for the complexity of inclusive search in the class of tree circuits
• Complexity of monotonic functions
• The Shannon function of the complexity of interval search on the Boolean cube in the class of trees
• On the complexity of the search of an extremum of a function
• scientific article; zbMATH DE number 4055688

Cited in

(6)

• Quantile and mean value measures of search process complexity
• General schemes of searching for preset solutions
• scientific article; zbMATH DE number 3974159 (Why is no real title available?)
• scientific article; zbMATH DE number 1057701 (Why is no real title available?)
• A lower bound for the complexity of inclusive search in the class of tree circuits
• The Shannon function of the complexity of interval search on the Boolean cube in the class of trees

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)