Povej prijatelju o tem izdelku:
Efficient Algorithms for Listing Combinatorial Structures - Distinguished Dissertations in Computer Science Goldberg, Leslie Ann (Sandia National Laboratories, Peru)
Cena
€ 142,49
Naročeno iz oddaljenega skladišča
Predvidena dobava 30. okt - 13. nov
Božična darila lahko vrnete do 31. januarja
Prejemajte obvestila o novih izdajah izvajalca Goldberg, Leslie Ann (Sandia National Laboratories, Peru)
Kaj pravijo naše stranke:
Dodaj na svoj seznam želja iMusic
Na voljo tudi kot:
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
| Medij | Knjige Hardcover Book (Knjiga s trdim hrbtom in platnicami) |
| Izdano | 22. aprila 1993 |
| ISBN13 | 9780521450218 |
| Založniki | Cambridge University Press |
| Strani | 178 |
| Dimenzije | 170 × 244 × 11 mm · 486 g (Teža (ocenjena)) |
| Jezik | Angleščina |
