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

DOI10.1007/978-3-030-57602-8_31zbMath1482.68225OpenAlexW3047934989MaRDI QIDQ2039682

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 spacesearch complexity

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The Design of Approximation Algorithms
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Communication Complexity

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