Efficient Algorithms for Listing Combinatorial Structures - Distinguished Dissertations in Computer Science - Goldberg, Leslie Ann (Sandia National Laboratories, Peru) - Books - Cambridge University Press - 9780521117883 - July 30, 2009
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
$ 60.99
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jun 1 - 11

Our customers say:

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

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.

180 pages, black & white illustrations

Media Books     Paperback Book   (Book with soft cover and glued back)
Released July 30, 2009
ISBN13 9780521117883
Publishers Cambridge University Press
Pages 180
Dimensions 170 × 244 × 10 mm   ·   300 g
Language English  

Mere med samme udgiver

See all of Goldberg, Leslie Ann (Sandia National Laboratories, Peru) ( e.g. Paperback Book and Hardcover Book )