Discrete Mathematical Structures
Subtitle: Theory and Applications
Publisher: Course Technology; Thomson Course Technology
Published: May 20, 2004
Language: eng
Number of pages: 928
ISBN-13: 9780619212858
Description: xiv, 905 p. : 29 cm. +
Table of contents: title: Preface
pagenum: ix; label: Chapter 1
title: Foundations: Sets, Logic, and Algorithms
pagenum: 1; title: Sets
pagenum: 2; title: Historical Notes: Georg Cantor
pagenum: 9; title: Historical Notes: John Venn
pagenum: 7; title: Mathematical Logic
pagenum: 26; title: Validity of Arguments
pagenum: 44; title: Quantifiers and First-Order Logic
pagenum: 53; title: Proof Techniques
pagenum: 63; title: Algorithms
pagenum: 73; title: Historical Notes: Muhammed Ibn Musa Al-Khwarizmi
pagenum: 74; title: Programming Exercises
pagenum: 87; label: Chapter 2
title: Integers and Mathematical Induction
pagenum: 89; title: Historical Notes: Pythagoras
pagenum: 90; title: Historical Notes: Andrew Wiles
pagenum: 91; title: Integers
pagenum: 92; title: Representation of Integers in Computer
pagenum: 111; title: Mathematical Induction
pagenum: 133; title: Prime Numbers
pagenum: 149; title: The Search for Primes
pagenum: 150; title: Historical Notes: Euclid
pagenum: 152; title: Historical Notes: Pierre de Fermat
pagenum: 158; title: Linear Diophantine Equations
pagenum: 163; title: Historical Notes: Diophantus
pagenum: 163; title: Programming Exercises
pagenum: 170; label: Chapter 3
title: Relations and Posets
pagenum: 173; title: Relations
pagenum: 174; title: Partially Ordered Sets
pagenum: 207; title: Historical Notes: Helmut Hasse
pagenum: 212; title: Application: Relational Database
pagenum: 227; title: Historical Notes: Edgar Codd
pagenum: 228; title: Programming Exercises
pagenum: 234; label: Chapter 4
title: Matrices and Closures of Relations
pagenum: 235; title: Matrices
pagenum: 236; title: Historical Notes: Arthur Cayley
pagenum: 236; title: Historical Notes: James Joseph Sylvester
pagenum: 237; title: The Matrix of a Relation and Closures
pagenum: 257; title: Historical Notes: Stephen Warshall
pagenum: 266; title: Programming Exercises
pagenum: 276; label: Chapter 5
title: Functions
pagenum: 277; title: Functions
pagenum: 278; title: Historical Notes: Johann Peter Gustave Lejeune Dirichlet
pagenum: 278; title: Historical Notes: Gottfried Wilhelm Leibnitz
pagenum: 279; title: Special Functions and Cardinality of a Set
pagenum: 298; title: Sequences and Strings
pagenum: 315; title: Binary Operations
pagenum: 331; title: Programming Exercises
pagenum: 340; label: Chapter 6
title: Congruences
pagenum: 341; title: Congruences
pagenum: 342; title: Historical Notes: Carl Friedrich Gauss
pagenum: 342; title: Check Digits
pagenum: 358; title: Historical Notes: George Laurer
pagenum: 367; title: Linear Congruences
pagenum: 378; title: Special Congruence Theorems
pagenum: 401; title: Historical Notes: RSA Key Encryption
pagenum: 407; title: Programming Exercises
pagenum: 413; label: Chapter 7
title: Counting Principles
pagenum: 415; title: Basic Counting Principles
pagenum: 416; title: Pigeonhole Principle
pagenum: 431; title: Permutations
pagenum: 438; title: Combinations
pagenum: 442; title: Generalized Permutations and Combinations
pagenum: 448; title: Binomial Coefficients
pagenum: 455; title: Historical Notes: Blaise Pascal
pagenum: 460; title: Generating Permutations and Combinations
pagenum: 469; title: Discrete Probability
pagenum: 477; title: Historical Notes: Pierre Simon de Laplace
pagenum: 477; title: Programming Exercises
pagenum: 488; label: Chapter 8
title: Recurrence Relations
pagenum: 489; title: Sequences and Recurrence Relations
pagenum: 490; title: Linear Homogeneous Recurrence Relations
pagenum: 512; title: Linear Nonhomogeneous Recurrence Relations
pagenum: 527; title: Programming Exercises
pagenum: 545; label: Chapter 9
title: Algorithms and Time Complexity
pagenum: 547; title: Algorithm Analysis
pagenum: 548; title: Various Algorithms
pagenum: 564; title: Programming Exercises
pagenum: 600; label: Chapter 10
title: Graph Theory
pagenum: 601; title: Historical Notes: Leonhard Euler
pagenum: 602; title: Graph Definition and Notations
pagenum: 603; title: Walks, Paths, and Cycles
pagenum: 619; title: Matrix Representation of a Graph
pagenum: 636; title: Special Circuits
pagenum: 644; title: Historical Notes: Sir William Rowan Hamilton
pagenum: 653; title: Isomorphism
pagenum: 661; title: Graph Algorithms
pagenum: 669; title: Historical Notes: Edsger Wybe Dijkstra
pagenum: 671; title: Planar Graphs and Graph Coloring
pagenum: 684; title: Historical Notes: Kazimierz Kuratowski
pagenum: 691; title: Programming Exercises
pagenum: 702; label: Chapter 11
title: Trees and Networks
pagenum: 703; title: Trees
pagenum: 704; title: Rooted Tree
pagenum: 712; title: Spanning Trees
pagenum: 731; title: Networks
pagenum: 743; title: Programming Exercises
pagenum: 766; label: Chapter 12
title: Boolean Algebra and Combinatorial Circuits
pagenum: 769; title: Two-Element Boolean Algebra
pagenum: 770; title: Historical Notes: George Boole
pagenum: 770; title: Historical Notes: Claude Elwood Shannon
pagenum: 771; title: Boolean Algebra
pagenum: 785; title: Logical Gates and Combinatorial Circuits
pagenum: 794; title: Historical Notes: Maurice Karnaugh
pagenum: 811; title: Programming Exercises
pagenum: 829; label: Chapter 13
title: Finite Automata and Languages
pagenum: 825; title: Finite Automata and Regular Languages
pagenum: 826; title: Finite State Machines with Input and Output
pagenum: 851; title: Grammars and Languages
pagenum: 860; title: Programming Exercises
pagenum: 874; title: Appendix
pagenum: 875; title: Answers
pagenum: 879; title: References
pagenum: 893; title: Index
pagenum: 897