Pastāsti draugiem par šo preci:
Efficient Algorithms for Listing Combinatorial Structures - Distinguished Dissertations in Computer Science Goldberg, Leslie Ann (Sandia National Laboratories, Peru)
Cena
€ 148,49
Pasūtīts no attālās noliktavas
Paredzamā piegāde . gada 14. - 28. aug.
Saņemiet paziņojumus par jauniem Goldberg, Leslie Ann (Sandia National Laboratories, Peru) izdevumiem
Mūsu klienti saka:
Pievienot savam iMusic vēlmju sarakstam
Pieejams arī kā:
Efficient Algorithms for Listing Combinatorial Structures - Distinguished Dissertations in Computer Science
Goldberg, Leslie Ann (Sandia National Laboratories, Peru)
First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. Some related work is also included which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem.
178 pages, bibliography, line diagrams, tables
| Mediji | Grāmatas Hardcover Book (Grāmata ar cieto muguriņu un vāku) |
| Izlaists | 1993. gada 22. aprīlis |
| ISBN13 | 9780521450218 |
| Izdevēji | Cambridge University Press |
| Lapas | 178 |
| Izmēri | 170 × 244 × 11 mm · 486 g (Svars (aptuveni)) |
| Valoda | Angļu |
Vairāk no tā paša izdevēja
Skatīt visus Goldberg, Leslie Ann (Sandia National Laboratories, Peru) ( piem., Paperback Book un Hardcover Book )