Efficient Algorithms for Listing Combinatorial Structures
Book Details
Format
Paperback / Softback
Book Series
Distinguished Dissertations in Computer Science
ISBN-10
0521117887
ISBN-13
9780521117883
Publisher
Cambridge University Press
Imprint
Cambridge University Press
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Jul 30th, 2009
Print length
180 Pages
Weight
300 grams
Dimensions
24.40 x 17.00 x 1.00 cms
Product Classification:
Combinatorics & graph theoryAlgorithms & data structures
Ksh 6,850.00
Manufactured on Demand
Delivery in 29 days
Delivery Location
Delivery fee: Select location
Delivery in 29 days
Secure
Quality
Fast
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.
Get Efficient Algorithms for Listing Combinatorial Structures by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Cambridge University Press and it has pages.
