✦ LIBER ✦

Computational complexity of multicriterion optimization

✍ Scribed by N. M. Popov

Publisher: Springer
Year: 1992
Tongue: English
Weight: 538 KB
Volume: 3
Category: Article
ISSN: 1046-283X
DOI: 10.1007/bf01127795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computer aided multicriterion optimizati

Computer aided multicriterion optimization system for computationally expensive functions

✍ A. Osyczka; W. Kuchta; R. Czuła 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 488 KB

Asymptotic optimality of some multicrite

Asymptotic optimality of some multicriterion optimization algorithms

✍ N. M. Popov 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 531 KB

Multicriterion optimization of complex s

Multicriterion optimization of complex systems with parameters ranked by descending importance

✍ A. Yu. Shcheglov 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 286 KB

Multicriterion optimization of strengthe

Multicriterion optimization of strengthened hybrid composite panels

✍ N. F. Mormul'; Yu. M. Pochtman 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 357 KB

Computational complexity of functions

✍ Leonid A. Levin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 330 KB

Degrees of computational complexity

✍ H.B. Enderton 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 316 KB

We consider a measure ~b of computational complexity. The measure 9 determines a binary relation on the recursive functions; F is no harder to compute than G iff for every index g of G there is an index f off such that for nearly all x, the difficulty off at x (as measured by ~) is no more than the