English
Paperback
₹3686
₹4250
13.27% OFF
(All inclusive*)
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
Looking to place a bulk order? SUBMIT DETAILS
Piracy-free
Assured Quality
Secure Transactions
About The Book
Description
Author(s)
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.
Piracy-free
Assured Quality
Secure Transactions
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
Details
ISBN 13
9780521117883
Publication Date
-30-07-2009
Pages
-180
Weight
-301 grams
Dimensions
-170x244x9.74 mm
