Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science) Book + PRICE WATCH * Amazon pricing is not included in price watch

Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science) Book

This thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists?Read More

from£N/A | RRP: £22.99
* Excludes Voucher Code Discount Also available Used from £N/A
  • 0521117887
  • 9780521117883
  • Leslie Ann Goldberg
  • 30 July 2009
  • Cambridge University Press
  • Paperback (Book)
  • 180
  • 1
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.

Would you like your name to appear with the review?

We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.

All form fields are required.