Zobacz książki o podobnej tematyce

Więcej informacji o Parameterized Complexity

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 836 punkty

Opis

An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now. The book is as self-contained as possible and includes a great deal of background material. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest.

Szczegóły książki

Kategoria Książki po angielsku Mathematics & science Mathematics Mathematical foundations

• Pełny tytuł: Parameterized Complexity
• Autor: Rodney G. Downey, M. R. Fellows
• Język: Angielski
• Oprawa: Miękka
• Liczba stron: 533
• EAN: 9781461267980
• ISBN: 1461267986
• ID: 06794930
• Wydawca: Springer-Verlag New York Inc.
• Waga: 836 g
• Wymiary: 235 × 155 × 30 mm
• Data wydania: 08. October 2012

Ulubione w innej kategorii

---

---

---