Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
Efficient Algorithms for Listing Combinatorial Structures
- Binding:
- Hardback
- Pages:
- 178
- Published:
- April 21, 1993
- Dimensions:
- 170x244x11 mm.
- Weight:
- 49 g.
Delivery:
2-3 weeks
Expected delivery: January 11, 2025
Extended return policy to January 30, 2025
About Leslie Ann (Sandia National Laboratories Goldberg
View all books by Leslie Ann (Sandia National Laboratories GoldbergDescription of Efficient Algorithms for Listing Combinatorial Structures
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.
User ratings of Efficient Algorithms for Listing Combinatorial Structures
Rate this book
In order to rate this book you must be logged in.Others also bought..
Find similar books
The book Efficient Algorithms for Listing Combinatorial Structures can be found in the following categories:
You can, at any time, unsubscribe from our newsletters.
© 2024 Tales
All packages are shipped from our warehouse in the UK.
Company address: Esromgade 15, 3. - 2200 - DK
Registered company number: DK43351621
