menu
{ "item_title" : "Foundations of Combinatorics with Applications", "item_author" : [" Edward A. Bender", "S. Gill Williamson "], "item_description" : "This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics.The four-part treatment begins with a section on counting and listing that covers basic counting, functions, decision trees, and sieving methods. The following section addresses fundamental concepts in graph theory and a sampler of graph topics. The third part examines a variety of applications relevant to computer science and mathematics, including induction and recursion, sorting theory, and rooted plane trees. The final section, on generating functions, offers students a powerful tool for studying counting problems. Numerous exercises appear throughout the text, along with notes and references. The text concludes with solutions to odd-numbered exercises and to all appendix exercises.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/0/48/644/603/0486446034_b.jpg", "price_data" : { "retail_price" : "22.95", "online_price" : "22.95", "our_price" : "22.95", "club_price" : "22.95", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Foundations of Combinatorics with Applications|Edward A. Bender

Foundations of Combinatorics with Applications

local_shippingShip to Me
On Order. Usually ships in 2-4 weeks
FREE Shipping for Club Members help

Overview

This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics.
The four-part treatment begins with a section on counting and listing that covers basic counting, functions, decision trees, and sieving methods. The following section addresses fundamental concepts in graph theory and a sampler of graph topics. The third part examines a variety of applications relevant to computer science and mathematics, including induction and recursion, sorting theory, and rooted plane trees. The final section, on generating functions, offers students a powerful tool for studying counting problems. Numerous exercises appear throughout the text, along with notes and references. The text concludes with solutions to odd-numbered exercises and to all appendix exercises.

Details

  • ISBN-13: 9780486446035
  • ISBN-10: 0486446034
  • Publisher: Dover Publications
  • Publish Date: February 2006
  • Dimensions: 9.2 x 6.36 x 0.9 inches
  • Shipping Weight: 1.42 pounds
  • Page Count: 480

Related Categories

You May Also Like...

    1

BAM Customer Reviews