Het boek is momenteel niet op voorraad
Meer over het boek
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.
Een boek kopen
Efficient Algorithms for Listing Combinatorial Structures, Leslie Ann Goldberg
- Taal
- Jaar van publicatie
- 2009
- product-detail.submit-box.info.binding
- (Paperback)
Zodra we het ontdekt hebben, sturen we een e-mail.
Betaalmethoden
Nog niemand heeft beoordeeld.
- Titel
- Efficient Algorithms for Listing Combinatorial Structures
- Taal
- Engels
- Auteurs
- Leslie Ann Goldberg
- Uitgever
- Cambridge University Press
- Jaar van publicatie
- 2009
- Formaat
- Paperback
- Aantal pagina's
- 180
- ISBN13
- 9780521117883
- Aantekening
- 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.