{
"item_title" : "Discrete Mathematics",
"item_author" : [" Biggs", "Norman L. Biggs "],
"item_description" : "The widespread use of computers and the rapid growth in computer science have led to a new emphasis on discrete mathematics, a discipline which deals with calculations involving a finite number of steps. This book provides a well-structured introduction to discrete mathematics, taking a self-contained approach that requires no ancillary knowledge of mathematics, avoids unnecessary abstraction, and incorporates a wide rage of topics, including graph theory, combinatorics, number theory, coding theory, combinatorial optimization, and abstract algebra. Amply illustrated with examples and exercises.",
"item_img_path" : "https://covers2.booksamillion.com/covers/bam/0/19/853/252/0198532520_b.jpg",
"price_data" : {
"retail_price" : "32.50", "online_price" : "32.50", "our_price" : "32.50", "club_price" : "32.50", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Overview
The widespread use of computers and the rapid growth in computer science have led to a new emphasis on discrete mathematics, a discipline which deals with calculations involving a finite number of steps. This book provides a well-structured introduction to discrete mathematics, taking a self-contained approach that requires no ancillary knowledge of mathematics, avoids unnecessary abstraction, and incorporates a wide rage of topics, including graph theory, combinatorics, number theory, coding theory, combinatorial optimization, and abstract algebra. Amply illustrated with examples and exercises.
Customers Also Bought
Details
- ISBN-13: 9780198532521
- ISBN-10: 0198532520
- Publisher: Oxford University Press, USA
- Publish Date: February 1986
- Page Count: 496
Related Categories
