Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology. Written in a lively, clear style that talks to the reader, the book is unique for its emphasis on algorithmics and the inductive and recursive paradigms as central mathematical themes. It includes a broad variety of applications ...
Read More
Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology. Written in a lively, clear style that talks to the reader, the book is unique for its emphasis on algorithmics and the inductive and recursive paradigms as central mathematical themes. It includes a broad variety of applications, not just to mathematics and computer science, but to natural and social science as well. A manual of selected solutions is available for sale to students; see sidebar. A complete solution manual is available free to instructors who have adopted the book as a required text.
Read Less
Add this copy of Discrete Algorithmic Mathematics to cart. $19.07, very good condition, Sold by Solr Books rated 5.0 out of 5 stars, ships from Skokie, IL, UNITED STATES, published 2005 by A K PETERS.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Very good. Pages are clean! Minor shelf wear They may be stickers or sticker residue on the cover. Fast Shipping-Each order powers our free bookstore in Chicago and sending books to Africa!
Add this copy of Discrete Algorithmic Mathematics to cart. $19.77, fair condition, Sold by BooksRun rated 5.0 out of 5 stars, ships from Philadelphia, PA, UNITED STATES, published 2005 by A K Peters/CRC Press.
Add this copy of Discrete Algorithmic Mathematics to cart. $19.95, good condition, Sold by BooksRun rated 5.0 out of 5 stars, ships from Philadelphia, PA, UNITED STATES, published 2005 by A K Peters/CRC Press.
Add this copy of Discrete Algorithmic Mathematics to cart. $30.07, good condition, Sold by SurplusTextSeller rated 5.0 out of 5 stars, ships from Columbia, MO, UNITED STATES, published 2005 by A K PETERS.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).
Add this copy of Discrete Algorithmic Mathematics to cart. $54.56, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 2005 by A K Peters/CRC Press.
Add this copy of Discrete Algorithmic Mathematics to cart. $61.53, good condition, Sold by TEXTSHUB rated 5.0 out of 5 stars, ships from Franklin Lakes, NJ, UNITED STATES, published 2005 by A K Peters/CRC Press.
Add this copy of Discrete Algorithmic Mathematics to cart. $82.41, good condition, Sold by Book Words rated 3.0 out of 5 stars, ships from Midland Park, NJ, UNITED STATES, published 2005 by A K Peters/CRC Press.
Add this copy of Discrete Algorithmic Mathematics to cart. $94.39, good condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2005 by A K PETERS.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Sewn binding. Cloth over boards. 804 p. Contains: Illustrations. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.