Il libro è attualmente esaurito
Maggiori informazioni sul libro
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.
Acquisto del libro
Efficient Algorithms for Listing Combinatorial Structures, Leslie Ann Goldberg
- Lingua
- Pubblicato
- 2009
- product-detail.submit-box.info.binding
- (In brossura)
Ti avviseremo via email non appena lo rintracceremo.
Metodi di pagamento
Ancora nessuna valutazione.
- Titolo
- Efficient Algorithms for Listing Combinatorial Structures
- Lingua
- Inglese
- Autori
- Leslie Ann Goldberg
- Editore
- Cambridge University Press
- Pubblicato
- 2009
- Formato
- In brossura
- Pagine
- 180
- ISBN13
- 9780521117883
- Descrizione
- 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.