| Titre : |
Discrete mathematics |
| Type de document : |
texte imprimé |
| Auteurs : |
Norman BIGGS, Auteur |
| Editeur : |
Oxford science publications |
| Année de publication : |
1989 |
| Importance : |
480 p. |
| Format : |
25 cm. |
| ISBN/ISSN/EAN : |
978-0-19-853427-3 |
| Langues : |
Anglais (eng) |
| Catégories : |
MATHÉMATIQUES:Algébre
|
| Index. décimale : |
04-03 Algébre |
| Résumé : |
This carefully structured text provides a comprehensive, straightforward treatment of discrete mathematics. The author's traditional, deductive approach avoids unnecessary abstraction and covers a wide range of topics, from graph theory and combinatorics to number theory, coding theory and algebraic methods. Abundant examples and exercises help students gain a solid understanding of the subject. The revised edition incorporates changes suggested by instructors already using the text. The new material includes descriptions of algorithms that closely resemble a real programming language for easier implementation by students of both mathematics and computer science.
SOMMAIRE:
NUMBERS AND COUNTING
Integers
Functions and counting
Principles of counting
Subests and designs
Partition, classification and distribution
Modular arithmetic
GRAPHS AND ALGORITHMS
Algorithms and their efficiency
Graphs
Tree, sorting and searching
Bipartie graphs and matching problems
Digraphs, networks and flows
Recursive techniques
ALGEBRAIC METHODS
Groups
Groups of permutations
Rings, fields and polynomials
Finite fields and some applications
Error-correcting codes
Generating functions
Partitions of a positive integer
Symmetry and counting
Answers to selected exercices |
Discrete mathematics [texte imprimé] / Norman BIGGS, Auteur . - Oxford science publications, 1989 . - 480 p. ; 25 cm. ISBN : 978-0-19-853427-3 Langues : Anglais ( eng)
| Catégories : |
MATHÉMATIQUES:Algébre
|
| Index. décimale : |
04-03 Algébre |
| Résumé : |
This carefully structured text provides a comprehensive, straightforward treatment of discrete mathematics. The author's traditional, deductive approach avoids unnecessary abstraction and covers a wide range of topics, from graph theory and combinatorics to number theory, coding theory and algebraic methods. Abundant examples and exercises help students gain a solid understanding of the subject. The revised edition incorporates changes suggested by instructors already using the text. The new material includes descriptions of algorithms that closely resemble a real programming language for easier implementation by students of both mathematics and computer science.
SOMMAIRE:
NUMBERS AND COUNTING
Integers
Functions and counting
Principles of counting
Subests and designs
Partition, classification and distribution
Modular arithmetic
GRAPHS AND ALGORITHMS
Algorithms and their efficiency
Graphs
Tree, sorting and searching
Bipartie graphs and matching problems
Digraphs, networks and flows
Recursive techniques
ALGEBRAIC METHODS
Groups
Groups of permutations
Rings, fields and polynomials
Finite fields and some applications
Error-correcting codes
Generating functions
Partitions of a positive integer
Symmetry and counting
Answers to selected exercices |
|  |
Accueil
Vous pouvez faire des propositions d'achat de livres, en utilisant
le formulaire en ligne
Faire une suggestion Affiner la recherche
