Obecnie nie mamy tej książki w magazynie
Więcej o książce
Focusing on the development of efficient algorithms, this thesis explores the intricacies of listing combinatorial structures. It delves into methodologies and techniques that enhance the performance of these algorithms, making significant contributions to the field of combinatorial design. The work, first published in 1993, presents theoretical insights and practical applications, appealing to researchers and practitioners interested in algorithm efficiency and combinatorial mathematics.
Zakup książki
Efficient Algorithms for Listing Combinatorial Structures, Leslie Ann Goldberg
- Język
- Rok wydania
- 2009
- Oprawa
- (miękka)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.
Metody płatności
Nikt jeszcze nie ocenił.
- Tytuł
- Efficient Algorithms for Listing Combinatorial Structures
- Język
- angielski
- Autorzy
- Leslie Ann Goldberg
- Wydawca
- Cambridge University Press
- Rok wydania
- 2009
- Oprawa
- miękka
- Liczba stron
- 180
- ISBN13
- 9780521117883
- Tagi
- Opis
- Focusing on the development of efficient algorithms, this thesis explores the intricacies of listing combinatorial structures. It delves into methodologies and techniques that enhance the performance of these algorithms, making significant contributions to the field of combinatorial design. The work, first published in 1993, presents theoretical insights and practical applications, appealing to researchers and practitioners interested in algorithm efficiency and combinatorial mathematics.