Gratisversand in ganz Deutschland!
Bookbot

Efficient Algorithms for Listing Combinatorial Structures

Parameter

  • 180 Seiten
  • 7 Lesestunden

Mehr zum Buch

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.

Publikation

Buchkauf

Efficient Algorithms for Listing Combinatorial Structures, Leslie Ann Goldberg

Sprache
Erscheinungsdatum
2009
product-detail.submit-box.info.binding
(Paperback)
Wir benachrichtigen dich per E-Mail.

Lieferung

  • Gratis Versand in ganz Deutschland!

Zahlungsmethoden

Keiner hat bisher bewertet.Abgeben