Skip to content
Menu Button
Scan a barcode
Scan
My Lists
Scan a barcode
Scan
Give More Get More: Earn bonus points
on every item with orders of 3+ books
Computers & Technology Books > Computer Science Books
Paperback Efficient Algorithms for Listing Combinatorial Structures Book
Share to Facebook
Share to Pinterest
Share to Twitter

ISBN: 0521117887

ISBN13: 9780521117883

Efficient Algorithms for Listing Combinatorial Structures

(Part of the Distinguished Dissertations in Computer Science Series)

by
No Customer Reviews

Select Format

Select Condition ThriftBooks Help Icon

Recommended

Format: Paperback

Condition: New

$46.99
50 Available
Ships within 2-3 days
Add to Wish List

Book Overview

First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following... This description may be from another edition of this product.

Related Subjects

Algorithms Computer Science Computers Computers & Technology Math Mathematics Programming Science & Math Textbooks

Customer Reviews

0 rating
Write a review
Trustpilot

Popular Categories

Website

My Account

Partnerships

Quick Help

About Us

ThriftBooks sells millions of used books at the lowest everyday prices. We personally assess every book's quality and offer rare, out-of-print treasures. We deliver the joy of reading in recyclable packaging with free standard shipping on US orders over $15. ThriftBooks.com. Read more. Spend less.

Follow Us

Link to Facebook
Link to Twitter
Link to Pinterest
Link to Tumblr
Link to Instagram
Copyright © 2024 Thriftbooks.com Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks® and the ThriftBooks® logo are registered trademarks of Thrift Books Global, LLC
GoDaddy Verified and Secured