Efficient Algorithms for Listing Combinatorial Structures |
|
| Author:
| Goldberg, Leslie Ann |
| Series title: | Distinguished Dissertations in Computer Science Ser. |
| ISBN: | 978-0-511-56991-3 |
| Publication Date: | Jan 2010 |
| Publisher: | Cambridge University Press
|
| Book Format: | Digital (delivered electronically) |
| List Price: | AUD $200.00 |
Book Description:
|
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.
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.