Complexity classes in optimization; Complexity of degeneracy; Complexity of gradients, Jacobians, and Hessians; Complexity theory; Complexity theory: Quadratic programming; Computational complexity theory; Fractional combinatorial optimization; Kolmogorov complexity; Mixed integer nonlinear programming; NP-complete problems and proof methodology; Parallel computing: Complexity classes INFORMATION-BASED COMPLEXITY AND INFORMATION-BASED OPTIMIZATION

Autor:	J. F. Traub, A. G. Werschulz
Rok vydání:	2001
DOI:	10.1007/0-306-48332-7_210
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::2e02ba9e5ff7d3a7bbf959a48579e95c https://doi.org/10.1007/0-306-48332-7_210 Zobrazit plný text záznamu