Efficient Algorithms for Listing Combinatorial Structures - Distinguished Dissertations in Computer Science - Goldberg, Leslie Ann (Sandia National Laboratories, Peru) - Books - Cambridge University Press - 9780521450218 - April 22, 1993
In case cover and title do not match, the title is correct

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

Price
R 2,497
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Nov 3 - 13
Christmas presents can be returned until 31 January
Get notified about new Goldberg, Leslie Ann (Sandia National Laboratories, Peru) releases

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Not rated yet

Also available as:

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

Media Books     Hardcover Book   (Book with hard spine and cover)
Released April 22, 1993
ISBN13 9780521450218
Publishers Cambridge University Press
Pages 178
Dimensions 170 × 244 × 11 mm   ·   486 g   (Weight (estimated))
Language English  

More from the same publisher

See all of Goldberg, Leslie Ann (Sandia National Laboratories, Peru)