Efficient Algorithms for Listing Combinatorial Structures - Goldberg Leslie Ann,Leslie Ann Goldberg
-30% ar kodu BOOKS
Piegāde 15-21 darba dienu laikā
30 dienu atgriešanas politika
This thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members, What general methods are useful for listing combinatorial structures, How can these be applied to those families that are of interes ... Pilns apraksts
Jums varētu patikt arī
Aprašymas
Vairāk informācijas
| Autors | Goldberg Leslie Ann, Leslie Ann Goldberg |
|---|---|
| Izdevējs | Cambridge University Press |
| Izlaides gads | 2009 |
| Vāka tips | Mīkstais vāks |
| EAN | 9780521117883 |