Search complexity: a way for the quantitative analysis of the search space
type: Item
instance of: scholarly article
title: Search complexity: a way for the quantitative analysis of the search space
zbMATH Open document ID: 1482.68225
DOI: 10.1007/978-3-030-57602-8_31
author: Li Ning
author: Yong Zhang
publication date: 2021-07-05T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 7367771
zbMATH Keywords: search complexity
zbMATH Keywords: search space
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: 978-3-030-57602-8 31
OpenAlex ID: W3047934989
cites work: Q4821526
cites work: Q3651735
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: Communication Complexity
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: The Design of Approximation Algorithms
description: scientific article; zbMATH DE number 7367771