9780131176867 / 0131176862

Prices INCLUDE standard shipping to United States
Show prices without shipping
Change shipping destination/currency
Shipping prices may be approximate. Please verify cost before checkout.

About the book:

This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem-solving techniques. The book provides complete coverage of: Logic and Proofs; Algorithms; Counting Methods and the Pigeonhole Principle; Recurrence Relations; Graph Theory; Trees; Network Models; Boolean Algebra and Combinatorial Circuits; Automata, Grammars, and Languages; Computational Geometry. For individuals interested in mastering introductory discrete mathematics.

Search under way...

Search complete.

Click on the price to find out more about a book.

New books: 1 - 10 of 45


Used books: 1 - 10 of 101