Fortell venner om denne varen:
Efficient Algorithms for Listing Combinatorial Structures - Distinguished Dissertations in Computer Science Goldberg, Leslie Ann (Sandia National Laboratories, Peru)
Pris
NOK 559
Bestillingsvarer
Forventes levert 5. - 19. nov
Julegaver kan byttes frem til 31. januar
Få varsel om nye utgivelser fra Goldberg, Leslie Ann (Sandia National Laboratories, Peru)
Legg til iMusic ønskeliste
eller
Finnes også som:
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.
180 pages, black & white illustrations
| Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| Utgitt | 30. juli 2009 |
| ISBN13 | 9780521117883 |
| Utgivere | Cambridge University Press |
| Antall sider | 180 |
| Mål | 170 × 244 × 10 mm · 300 g |
| Språk | Engelsk |
