Handbook of Discrete and Combinatorial Mathematics, Second Edition / Edition 1

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $59.58
Usually ships in 1-2 business days
(Save 64%)
Other sellers (Hardcover)
  • All (5) from $59.58   
  • Used (5) from $59.58   

Overview

The importance of discrete mathematics has increased dramatically with in the last few years but until now, it has been difficult-if not impo ssible-to find a single reference book that effectively covers the sub ject. To fill that void, The Handbook of Discrete and Combinatorial Ma thematics presents a comprehensive collection of ready reference mater ial for all of the important areas of discrete mathematics, including those essential to its applications in computer science and engineerin g.

Read More Show Less

Product Details

  • ISBN-13: 9780849301490
  • Publisher: Taylor & Francis
  • Publication date: 9/28/1999
  • Series: Discrete Mathematics and Its Applications Series
  • Edition description: New Edition
  • Edition number: 1
  • Pages: 1248
  • Product dimensions: 7.20 (w) x 10.10 (h) x 2.60 (d)

Table of Contents

Foundations, edited by J. Gross
Propositional and Predicate Logic
Set Theory
Functions
Relations
Proof Techniques
Axiomatic Program Verification
Logic-Based Computer Programming Paradigms
Counting Methods, edited by J. Gross
Summary of Counting Problems
Basic Counting Techniques
Permutations and Combinations
Inclusion/Exclusion
Partitions
Burnside/Polya Counting
Mobius Inversion Counting
Young Tableaux
Sequences, edited by D. Shier and J. Gross
Special Sequences
Generating Functions
Recurrence Relations
Finite Differences
Finite Sums and Summation
Asymptotes of Sequences
Number Theory, edited by K. Rosen
Basics
Primes and Factorization
Multiplicative Functions
Quadratic Residues and Primitive Roots
Diophantine Equations
Diophantine Approximation
Algebraic Number Theory
Algebraic Structures, edited by J. Michaels
Algebraic Models
Groups
Permutation Groups
Rings
Polynomial Rings
Fields
Lattices
Boolean Algebra
Linear Algebra, edited by D. Shier
Vector Spaces
Linear Transformations
Matrix Algebra
Linear Systems
Eigenanalysis
Combinatorial Matrix Theory
Transforms
Discrete Probability, edited by D. Shier
Fundamental Concepts
Independence and Dependence
Random Variables
Probabilistic and Combinatorial Computations
Random Walks
System Reliability
Discrete-Time Markov Chains
Queuing Theory
Simulation
Graph Theory, edited by J. Gross
Generalities
Paths and Circuits
Isomorphism
Graph and Map Coloring
Planarity
Topological Graph Theory
Graphical Enumeration
Directed Graphs
Algebraic Graph Theory
Analytic Graph Theory
Hypergraphs
Trees, edited by J. Gross
Characterization of Trees
Spanning Trees
Enumerating Trees
Applications of Trees to Networks
Networks and Flows, edited by D. Shier
Minimum Spanning Trees
Shortest Paths
Matchings
Maximum Flows
Minimum Cost Flows
Communication Networks
Heuristic Approaches
Network Representations and Data Structures
Partially Ordered Sets, edited by J. Gross
Fundamental Definitions and Examples
Further Development
Connections to Other Areas
Combinatorial Designs, edited by J. Michaels
Block Designs and Finite Geometries
Symmetric Designs and Finite Geometries
Latin Squares and Orthogonal Arrays
Matroids
Discrete and Computational Geometry, edited by J. Michaels
Arrangements of Geometric Objects
Space Filling
Combinatorial Results in Geometry
Polyhedra
Algorithms and Complexity in Computational Geometry
Geometric Data Structures and Searching
Computational Techniques
Applications of Geometry
Coding Theory and Cryptology, edited by K. Rosen
Basic Concepts of Coding Theory
Linear Codes
Bounds
Convolutional Code
Cryptology: Definitions
Private Key Schemes
Public Key Schemes
Discrete Optimization, edited by D. Shier
Linear Programming
Algorithmic Strategies
Location Theory
Packing and Covering
Activity Nets
Game Theory
Sperner's Lemma and Fixed-Point Theorems
Theoretical Computer Science, edited by J. Gross
Formal Languages
Machine Models
Computability
Algorithmic Complexity
Complexity Classes
Randomized Algorithms
Information Structures, edited by J. Gross
Abstract Data Types
Concrete Data Structures
Sorting and Searching
Hashing
Dynamic Graph Algorithms

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)