Efficient Algorithms for Listing Combinatorial Structures - Distinguished Dissertations in Computer Science - Goldberg, Leslie Ann (Sandia National Laboratories, Peru) - Knjige - Cambridge University Press - 9780521117883 - 30. julija 2009
Če se naslovnica in naslov ne ujemata, je naslov pravilen

Goldberg, Leslie Ann (Sandia National Laboratories, Peru)
Efficient Algorithms for Listing Combinatorial Structures - Distinguished Dissertations in Computer Science

Cena
€ 55,49

Naročeno iz oddaljenega skladišča

Predvidena dobava 5. - 19. okt
Prejemajte obvestila o novih izdajah izvajalca Goldberg, Leslie Ann (Sandia National Laboratories, Peru)

Kaj pravijo naše stranke:

14-dnevna politika vračila v skladu z evropsko zakonodajo o varstvu potrošnikov
Najvišja ocena na Trustpilot
Dodaj na svoj seznam želja iMusic

Not rated yet

Na voljo tudi kot:

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

Medij Knjige     Paperback Book   (Knjiga z mehkimi platnicami in lepljenim hrbtom)
Izdano 30. julija 2009
ISBN13 9780521117883
Založniki Cambridge University Press
Strani 180
Dimenzije 170 × 244 × 10 mm   ·   300 g
Jezik Angleščina  

Več od istega **izdajatelja**

Ogled vseh Goldberg, Leslie Ann (Sandia National Laboratories, Peru)