Het boek is momenteel niet op voorraad
Meer over het boek
Focusing on the design of efficient algorithms, this thesis explores methods for listing combinatorial structures. It delves into the intricacies of combinatorial design and algorithmic efficiency, providing insights that are essential for researchers and practitioners in the field. The work, first published in 1993, contributes to the understanding of how to effectively generate and manage combinatorial configurations.
Een boek kopen
Efficient Algorithms for Listing Combinatorial Structures, Leslie Ann Goldberg
- Taal
- Jaar van publicatie
- 2012
- product-detail.submit-box.info.binding
- (Hardcover)
Zodra we het ontdekt hebben, sturen we een e-mail.
Betaalmethoden
Nog niemand heeft beoordeeld.
- Taal
- Engels
- Auteurs
- Leslie Ann Goldberg
- Uitgever
- Cambridge University Press
- Jaar van publicatie
- 2012
- Formaat
- Hardcover
- Aantal pagina's
- 178
- ISBN13
- 9780521450218
- Aantekening
- Focusing on the design of efficient algorithms, this thesis explores methods for listing combinatorial structures. It delves into the intricacies of combinatorial design and algorithmic efficiency, providing insights that are essential for researchers and practitioners in the field. The work, first published in 1993, contributes to the understanding of how to effectively generate and manage combinatorial configurations.