Efficient Algorithms for Listing Combinatorial Structures
shared
This Book is Out of Stock!

About The Book

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
Piracy-free
Assured Quality
Assured Quality
Secure Transactions
Secure Transactions
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
11808
12430
5% OFF
Hardback
Out Of Stock
All inclusive*
downArrow

Details


LOOKING TO PLACE A BULK ORDER?CLICK HERE