Search complexity: a way for the quantitative analysis of the search space

DOI10.1007/978-3-030-57602-8_31MaRDI QIDQ2039682zbMATH OpenOpenAlexFDO

Authors Li Ning, Yong Zhang

Publication date 5 July 2021

Full work available at URL https://doi.org/10.1007/978-3-030-57602-8_31

zbMATH Keywords

approximationsearch complexitysearch space

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On the complexity of the search of an extremum of a function
• Sample complexity of model-based search
• Black-box complexity for bounding the performance of randomized search heuristics
• A Complexity Analysis of Local Search Algorithms in Global Optimization
• scientific article; zbMATH DE number 4062645

Cites work

• An analysis of approximations for maximizing submodular set functions—I
• Communication Complexity
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Introduction to algorithms.
• The design of approximation algorithms

Cited in

(4)

• Sample complexity of model-based search
• Quantile and mean value measures of search process complexity
• scientific article; zbMATH DE number 1057701 (Why is no real title available?)
• Анализ сложности алгоритма параллельного поиска “золотой” коллизии

This page was built for publication: Search complexity: a way for the quantitative analysis of the search space

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